On random polynomials over finite fields
From MaRDI portal
Publication:4277220
DOI10.1017/S0305004100071620zbMath0789.60034OpenAlexW2102753310MaRDI QIDQ4277220
Simon Tavaré, Richard Arratia, Andrew David Barbour
Publication date: 24 February 1994
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004100071620
Related Items
Limits of logarithmic combinatorial structures., The distribution of rare alleles, Random polynomials over a finite field, The order of a typical matrix with entries in a finite field, Roots of Polynomials and the Derangement Problem, On Tensor-Factorisation Problems,I: The Combinatorial Problem, Uniform estimates for almost primes over finite fields, A Rate for the Erdős-Turán Law, Irreducible polynomials of bounded height, Order statistics for decomposable combinatorial structures, Equal sums in random sets and the concentration of divisors, Asymptotic behavior of some factorizations of random words, Analytic number theory for 0-cycles, Iteration entropy, On strong and almost sure local limit theorems for a probabilistic model of the Dickman distribution, Random matrix theory over finite fields, Euler’s constant: Euler’s work and modern developments, Applications of symmetric functions to cycle and increasing subsequence structure after shuffles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gaussian limiting distributions for the number of components in combinatorial structures
- Witt vectors and the algebra of necklaces
- Continuity and weak convergence of ranked and size-biased permutations on the infinite simplex
- Random permutations and Brownian motion
- Poisson process approximations for the Ewens sampling formula
- Strong approximation theorems for density dependent Markov chains
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- Ordered Cycle Lengths in a Random Permutation
- The fundamental limit theorems in probability
