Iterations of quadratic polynomials over finite fields
From MaRDI portal
Abstract: Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have length on the order of p^(1/2). We give a heuristic argument that suggests that the statistical properties of this set might be very similar to the Birthday Problem random variable X_n, for an n=p day year, and offer considerable experimental evidence that the limiting distribution of these set lengths, divided by p^(1/2), for pleq x as x goes to infinity, converges to the limiting distribution of X_n/n^(1/2), as n goes to infinity.
Recommendations
- Iteration of quadratic polynomials over finite fields
- A refined conjecture for factorizations of iterates of quadratic polynomials over finite fields
- Settled polynomials over finite fields
- On the length of critical orbits of stable quadratic polynomials
- A survey on iterations of mappings over finite fields
Cited in
(11)- scientific article; zbMATH DE number 4027619 (Why is no real title available?)
- A refined conjecture for factorizations of iterates of quadratic polynomials over finite fields
- On the length of critical orbits of stable quadratic polynomials
- scientific article; zbMATH DE number 5003329 (Why is no real title available?)
- On Repeated Squarings in Binary Fields
- Irreducibility of the iterates of a quadratic polynomial over a field
- Iteration of polynomials \(AX^d + C\) over finite fields
- Settled polynomials over finite fields
- Expansions of quadratic maps in prime fields
- Iteration of quadratic polynomials over finite fields
- Irreducibility of iterates of post-critically finite quadratic polynomials over \(\mathbb{Q}\)
This page was built for publication: Iterations of quadratic polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q365960)
