Iterations of quadratic polynomials over finite fields (Q365960)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterations of quadratic polynomials over finite fields |
scientific article; zbMATH DE number 6207236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterations of quadratic polynomials over finite fields |
scientific article; zbMATH DE number 6207236 |
Statements
Iterations of quadratic polynomials over finite fields (English)
0 references
10 September 2013
0 references
arithmetic dynamics
0 references
birthday problem
0 references
forward orbit modulo \(p\)
0 references
random maps
0 references
Polynomial maps over finite fields are believed to behave like random maps, even though there are very few rigorous results in this direction. The normalised length of an orbit of a random map obeys a limiting smooth distribution function. The author computes the length of the forward orbit of a quadratic polynomial \(f(z)=z^2+c\) over the field of \(p\) elements, for fixed parameter \(c\) and fixed integer initial condition \(\alpha\).NEWLINENEWLINEThe data collected from approximately two million primes provide convincing evidence that the normalised length of polynomial orbits is asymptotically (large \(p\)) distributed according to the aforementioned distribution. A related problem -- the density of the set of primes for which the orbit through \(\alpha\) passes through the origin -- is also considered and analysed using similar methods. These findings lead to the formulation of two conjectures.
0 references
0.8100464940071106
0 references
0.7864717841148376
0 references
0.7828111052513123
0 references
0.7751268744468689
0 references
0.7711277604103088
0 references