2000 character limit reached
The Graph Structure of Chebyshev Polynomials over Finite Fields and Applications
Published 17 Mar 2018 in cs.DM and math.CO | (1803.06539v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.