On the degrees of polynomial divisors over finite fields
From MaRDI portal
Publication:5360417
DOI10.1017/S030500411600044XzbMATH Open1371.12002arXiv1507.01920OpenAlexW3105164544MaRDI QIDQ5360417FDOQ5360417
Authors: Andreas Weingartner
Publication date: 28 September 2017
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Abstract: We show that the proportion of polynomials of degree over the finite field with elements, which have a divisor of every degree below , is given by . More generally, we give an asymptotic formula for the proportion of polynomials, whose set of degrees of divisors has no gaps of size greater than . To that end, we first derive an improved estimate for the proportion of polynomials of degree , all of whose non-constant divisors have degree greater than . In the limit as , these results coincide with corresponding estimates related to the cycle structure of permutations.
Full work available at URL: https://arxiv.org/abs/1507.01920
Recommendations
Cites Work
- Analytic combinatorics
- Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples
- Title not available (Why is that?)
- On integers \(n\) for which \(X^n-1\) has a divisor of every degree
- On the degrees of divisors of \(T^{n}-1\)
- On the divisors of \(x^n-1\) in \(\mathbb F_p[x]\)
- Sur un problème de crible et ses applications
- Integers with dense divisors 3
- Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel
- Integers with dense divisors. I
- Polynomials with divisors of every degree
- Practical numbers and the distribution of divisors
- Local probabilities and total variation distance for random permutations
- Title not available (Why is that?)
- Analysis of Ben-Or's polynomial irreducibility test
- Some problems in analytic number theory for polynomials over a finite field
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Differential Delay Equation Arising from the Sieve of Eratosthenes
- Title not available (Why is that?)
- Prime Suspects
Cited In (12)
- Divisibility of polynomials over finite fields and combinatorial applications
- Uniform estimates for almost primes over finite fields
- On counting polynomials over finite fields
- Set partitions without blocks of certain sizes
- Degree bounds for the division problem in polynomial ideals
- Degree \(k\) linear recursions mod \((p)\) and number fields
- On the constant factor in several related asymptotic estimates
- On the mean value of the functions related to the divisor function on the ring of polynomials over a finite field
- Asymptotic estimates for the number of permutations without short cycles
- On the common index divisors of a dihedral field of prime degree
- On the degrees of irreducible factors of polynomials over a finite field
- On the degrees of divisors of \(T^{n}-1\)
This page was built for publication: On the degrees of polynomial divisors over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360417)