Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T09:32:02.648Z Has data issue: false hasContentIssue false
  • English
  • Français

On the degrees of polynomial divisors over finite fields

Published online by Cambridge University Press:  19 May 2016

ANDREAS WEINGARTNER
ANDREAS WEINGARTNER*
Affiliation:
Southern Utah University, Cedar City, Utah 84720, U.S.A. e-mail: weingartner@suu.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

We show that the proportion of polynomials of degree n over the finite field with q elements, which have a divisor of every degree below n, is given by c q n −1 + O(n −2). 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 m. To that end, we first derive an improved estimate for the proportion of polynomials of degree n, all of whose non-constant divisors have degree greater than m. In the limit as q → ∞, these results coincide with corresponding estimates related to the cycle structure of permutations.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 161 , Issue 3 , November 2016 , pp. 469 - 487
Copyright
Copyright © Cambridge Philosophical Society 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Arratia, R., Barbour, A. D. and Tavaré, S. Random combinatorial structures and prime factorizations. Not. Amer. Math. Soc. 44 (1997), 903–910.Google Scholar
[2] Cheer, A. Y. and Goldston, D. A. A differential delay equation arising from the sieve of Eratosthenes. Math. Comp. 55 (1990), 129–141.Google Scholar
[3] Dixmier, J. and Nicolas, J.-L.. Partitions without small parts. Number Theory, Vol. I (Budapest, 1987), 9–33, Colloq. Math. Soc. János Bolyai, 51 (North-Holland, Amsterdam, 1990).Google Scholar
[4] Erdős, P. and Szalay, M.. On some problems of J. Dénes and P. Turán, Stud. Pure Math. (Birkhäuser, Basel, 1983), 187–212.Google Scholar
[5] Flajolet, P. and Sedgewick, R. Analytic Combinatorics (Cambridge University Press, 2009).CrossRefGoogle Scholar
[6] Gao, S. and Panario, D. Tests and constructions of irreducible polynomials over finite fields. Foundations of Computational Mathematics (Rio de Janeiro, 1997), (Springer, Berlin, 1997), 346–361.Google Scholar
[7] Granville, A. The anatomy of integers and permutations, http://www.dms.umontreal.ca/~andrew/PDF/Anatomy.pdf Google Scholar
[8] Lidl, R. and Niederreiter, H. Finite Fields. Encyclopedia Math. Appli. Vol. 20 (Cambridge University Press, 1997).Google Scholar
[9] Manstavičius, E. On permutations missing short cycles. Lietuvos matem. rink., spec. issue, 42 (2002), 1–6.Google Scholar
[10] Manstavičius, E. and Petuchovas, R.. Local probabilities and total variation distance for random permutations, to appear in Ramanujan J. Google Scholar
[11] Panario, D. and Richmond, B. Analysis of Ben-Or's polynomial irreducibility test. Random Structures Algorithms 13 (1998), 439–456.Google Scholar
[12] Pollack, P. and Thompson, L. On the degrees of divisors of Tn - 1. New York J. Math. 19 (2013), 91–116.Google Scholar
[13] Pomerance, C., Thompson, L. and Weingartner, A. On integers n for which Xn - 1 has a divisor of every degree, arXiv:1511:03357.Google Scholar
[14] Rudnick, Z. Some problems in analytic number theory for polynomials over a finite field, arXiv:1501.01769.Google Scholar
[15] Saias, E. Entiers à diviseurs denses 1. J. Number Theory 62 (1997), 163–191.Google Scholar
[16] Tenenbaum, G. Sur un problème de crible et ses applications. Ann. Sci. École Norm. Sup. (4) 19 (1986), 1–30.Google Scholar
[17] Tenenbaum, G. Sur un problème de crible et ses applications, 2. Corrigendum et étude du graphe divisoriel. Ann. Sci. École Norm. Sup. (4) 28 (1995), 115–127.Google Scholar
[18] Tenenbaum, G. Introduction to Analytic and Probabilistic Number Theory. Camb. Stud. Adv. Math., Vol. 46 (Cambridge University Press, 1995).Google Scholar
[19] Thompson, L. Polynomials with divisors of every degree. J. Number Theory 132 (2012), 1038–1053.Google Scholar
[20] Thompson, L. On the divisors of x n −1 in F p [x]. Int. J. Number Theory 9 (2013), 421–430.Google Scholar
[21] Warlimont, R. Arithmetical semigroups II: sieving by large and small prime elements. Sets of multiples. Manuscripta Math. 71 (1991), 197–221.Google Scholar
[22] Weingartner, A. Integers with dense divisors 3. J. Number Theory 142 (2014), 211–222.Google Scholar
[23] Weingartner, A. Practical numbers and the distribution of divisors. Q. J. Math. 66 (2015), 743–758.CrossRefGoogle Scholar