Skip to main content
×
Home
    • Aa
    • Aa

On random polynomials over finite fields

  • Richard Arratia (a1), A. D. Barbour (a2) and Simon Tavaré (a1)
Abstract
Abstract

We consider random monic polynomials of degree n over a finite field of q elements, chosen with all qn possibilities equally likely, factored into monic irreducible factors. More generally, relaxing the restriction that q be a prime power, we consider that multiset construction in which the total number of possibilities of weight n is qn. We establish various approximations for the joint distribution of factors, by giving upper bounds on the total variation distance to simpler discrete distributions. For example, the counts for particular factors are approximately independent and geometrically distributed, and the counts for all factors of sizes 1, 2, …, b, where b = O(n/log n), are approximated by independent negative binomial random variables. As another example, the joint distribution of the large factors is close to the joint distribution of the large cycles in a random permutation. We show how these discrete approximations imply a Brownian motion functional central limit theorem and a Poisson-Dirichiet limit theorem, together with appropriate error estimates. We also give Poisson approximations, with error bounds, for the distribution of the total number of factors.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2]R. A. Arratia , A. D. Barbour and S. Tavaré . Poisson process approximations for the Ewens Sampling Formula. Ann. Appl. Prob. 2 (1992), 519535.

[8]J. M. de Laurentis and B. G. Pittel . Random permutations and Brownian motion. Pacific J. Math. 119 (1985), 287301.

[11]P. Donnelly and P. Joyce . Continuity and weak convergence of ranked and size-biassed permutations on an infinite simplex. Stoch. Proc. Applns 31 (1989), 89103.

[12]W. Feller . The fundamental limit theorems in probability. Bull. Amer. Math. Soc. 51 (1945), 800832.

[14]P. Flajolet and M. Soria . Gaussian limiting distributions for the number of components in combinatorial structures. J. Comb. Th. A 53 (1990), 165182.

[18]J. Komlós , P. Major and G. Tusnády . An approximation of partial sums of independent RV-s, and the sample DF. I, Z. Wahrscheinlichkeitstheorie verw. Geb. 32 (1975), 111131.

[19]T. G. Kurtz . Strong approximation theorems for density dependent Markov chains. Stoch. Proc. Applns 6 (1978), 223240.

[21]N. Metropolis and G.-C. Rota . Witt vectors and the algebra of necklaces. Adv. Math. 50 (1983), 95125.

[22]N. Metropolis and G.-C. Rota . The cyclotomic identity. In Contemporary Mathematics 34, (American Mathematical Society, 1984), pp. 1927.

[25]L. A. Shepp and S. P. Lloyd . Ordered cycle lengths in a random permutation. Trans. Amer. Math. Soc. 121 (1966), 340357.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Proceedings of the Cambridge Philosophical Society
  • ISSN: 0305-0041
  • EISSN: 1469-8064
  • URL: /core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×