Periods of iterations of functions with restricted preimage sizes
From MaRDI portal
Publication:4987448
Abstract: We consider random mappings on n = kr nodes with preimage sizes restricted to a set of the form {0,k}, where k = k(r) is greater than 1. We prove that T, the least common multiple of the cycle lengths, and B= the product of the cycle lengths, are both asymptotically lognormal. The expected values of these random variables are also also estimated and compared with numerical results. This work is motivated, in part, by the use of these mappings as heuristic models for polynomials of the form x^k + a over the integers modulo p with p congruent to 1 mod k.
Recommendations
Cited in
(7)- Period Lengths for Iterated Functions
- Iteration entropy
- A survey on iterations of mappings over finite fields
- Periods of iterations of mappings over finite fields with restricted preimage sizes
- Periods of iterated rational functions
- On the heuristic of approximating polynomials over finite fields by random mappings
- Random mappings with restricted preimages
This page was built for publication: Periods of iterations of functions with restricted preimage sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987448)