The Graph Structure of Chebyshev Polynomials over Finite Fields and Applications
classification
💻 cs.DM
math.CO
keywords
chebyshevpolynomialsaveragefieldsfinitegraphapplicationsassociated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.