The Graph Structure of Chebyshev Polynomials over Finite Fields and Applications
Discrete Mathematics
2018-03-20 v1 Combinatorics
Abstract
We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and the expected value for the period and preperiod of iterating Chebyshev polynomials.
Keywords
Cite
@article{arxiv.1803.06539,
title = {The Graph Structure of Chebyshev Polynomials over Finite Fields and Applications},
author = {Claudio Qureshi and Daniel Panario},
journal= {arXiv preprint arXiv:1803.06539},
year = {2018}
}