Uniform estimates for smooth polynomials over finite fields
We establish new estimates for the number of m-smooth polynomials of degree n over a finite field Fq, where the main term involves the number of m-smooth permutations on n elements. Our estimates imply that the probability that a random polynomial of degree n is m-smooth is asymptotic to the probabi...
| Glavni avtor: | |
|---|---|
| Format: | Journal article |
| Jezik: | English |
| Izdano: |
Discrete Analysis
2023
|
| _version_ | 1826312358011600896 |
|---|---|
| author | Gorodetsky, O |
| author_facet | Gorodetsky, O |
| author_sort | Gorodetsky, O |
| collection | OXFORD |
| description | We establish new estimates for the number of m-smooth polynomials of degree n over a finite field Fq, where the main term involves the number of m-smooth permutations on n elements. Our estimates imply that the probability that a random polynomial of degree n is m-smooth is asymptotic to the probability that a random permutation on n elements is m-smooth, uniformly for m ≥ (2 + ε) logqn as qn → ∞. This should be viewed as an unconditional analogue of works of Hildebrand and of Saias in the integer setting, which assume the Riemann Hypothesis. Moreover, we show that the range m ≥ (2 + ε) logqn is sharp; this should be viewed as a resolution of a (polynomial analogue of a) conjecture of Hildebrand. As an application of our estimates, we determine the rate of decay in the asymptotic formula for the expected degree of the largest prime factor of a random polynomial. |
| first_indexed | 2024-03-07T08:27:46Z |
| format | Journal article |
| id | oxford-uuid:87164073-c1fb-4cff-9286-f3401a1ef278 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T08:27:46Z |
| publishDate | 2023 |
| publisher | Discrete Analysis |
| record_format | dspace |
| spelling | oxford-uuid:87164073-c1fb-4cff-9286-f3401a1ef2782024-02-22T09:31:57ZUniform estimates for smooth polynomials over finite fieldsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:87164073-c1fb-4cff-9286-f3401a1ef278EnglishSymplectic ElementsDiscrete Analysis2023Gorodetsky, OWe establish new estimates for the number of m-smooth polynomials of degree n over a finite field Fq, where the main term involves the number of m-smooth permutations on n elements. Our estimates imply that the probability that a random polynomial of degree n is m-smooth is asymptotic to the probability that a random permutation on n elements is m-smooth, uniformly for m ≥ (2 + ε) logqn as qn → ∞. This should be viewed as an unconditional analogue of works of Hildebrand and of Saias in the integer setting, which assume the Riemann Hypothesis. Moreover, we show that the range m ≥ (2 + ε) logqn is sharp; this should be viewed as a resolution of a (polynomial analogue of a) conjecture of Hildebrand. As an application of our estimates, we determine the rate of decay in the asymptotic formula for the expected degree of the largest prime factor of a random polynomial. |
| spellingShingle | Gorodetsky, O Uniform estimates for smooth polynomials over finite fields |
| title | Uniform estimates for smooth polynomials over finite fields |
| title_full | Uniform estimates for smooth polynomials over finite fields |
| title_fullStr | Uniform estimates for smooth polynomials over finite fields |
| title_full_unstemmed | Uniform estimates for smooth polynomials over finite fields |
| title_short | Uniform estimates for smooth polynomials over finite fields |
| title_sort | uniform estimates for smooth polynomials over finite fields |
| work_keys_str_mv | AT gorodetskyo uniformestimatesforsmoothpolynomialsoverfinitefields |