Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-23T21:32:26.163Z Has data issue: false hasContentIssue false
  • English
  • Français

Factorization in Fq[x] and Brownian Motion

Published online by Cambridge University Press:  12 September 2008

Jennie C. Hansen
Jennie C. Hansen
Affiliation:
Actuarial Mathematics and Statistics Department, Heriot-Watt University, Edinburgh, Scotland
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the set of polynomials of degree n over a finite field and put the uniform probability measure on this set. Any such polynomial factors uniquely into a product of its irreducible factors. To each polynomial we associate a step function on the interval [0,1] such that the size of each jump corresponds to the number of factors of a certain degree in the factorization of the random polynomial. We normalize these random functions and show that the resulting random process converges weakly to Brownian motion as n → ∞. This result complements earlier work by the author on the order statistics of the degree sequence of the factors of a random polynomial.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 3 , September 1993 , pp. 285 - 299
Copyright
Copyright © Cambridge University Press 1993

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

[1]Arratia, R., Barbour, A. D., and Tavaré, S. (1993) On random polynomials over finite fields. Math. Proc. Camb. Phil. Soc. (in press).CrossRefGoogle Scholar
[2]Arratia, R. and Tavaré, S. (1992) Limit Theorems for combinatorial structures via discrete process approximations. Rand. Struc. Alg. 3 321–345.CrossRefGoogle Scholar
[3]Berlekamp, E. (1984) Algebraic Coding Theory, 2nd ed., Aegean Park Press.Google Scholar
[4]Billingsley, P. (1976) Convergence of probability measures, Wiley, NY.Google Scholar
[5]Billingsley, P. (1979) Probability and Measure, Wiley, NY.Google Scholar
[6]DeLaurentis, J. M. and Pittel, B. (1985) Random permutations and Brownian motion. Pacific J. Math. 119 287–301.CrossRefGoogle Scholar
[7]Flajolet, P. and Soria, M. (1990) Gaussian limiting distributions for the number of components in combinatorial structures. Jour. Comb. Theor. A. 153 165–182.CrossRefGoogle Scholar
[8]Goh, W. and Schmutz, E. (1993) Random matrices and Brownian motion. Combinatorics, Probability and Computing 2 157–180.CrossRefGoogle Scholar
[9]Hansen, J. C. (1989) A functional central limit theorem for random mappings. Ann. Probab. 17 317–332.CrossRefGoogle Scholar
[10]Hansen, J. C. (1990) A functional central limit theorem for the Ewens sampling formula. J. Appl. Prob. 27 28–47.CrossRefGoogle Scholar
[11]Hansen, J. C. (1993) Order statistics for decomposable combinatorial structures. Rand. Struc. Alg. (to appear).Google Scholar
[12]Hansen, J. C. and Schmutz, E. (1993) How random is the characteristic polynomial of a random matrix? Math. Proc. Camb. Phil. Soc. (to appear).CrossRefGoogle Scholar
[13]Shepp, L. A. and Lloyd, S. P. (1966) Ordered cycle lengths in a random permutation. Trans. Amer. Math. Soc. 121 340–357.CrossRefGoogle Scholar