cicyt UNIZAR
Full-text links:

Download:

Current browse context:

cs.DM

Change to browse by:

References & Citations

DBLP - CS Bibliography

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo ScienceWISE logo

Computer Science > Discrete Mathematics

Title: The Graph Structure of Chebyshev Polynomials over Finite Fields and Applications

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.
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
Cite as: arXiv:1803.06539 [cs.DM]
  (or arXiv:1803.06539v1 [cs.DM] for this version)

Submission history

From: Claudio Qureshi [view email]
[v1] Sat, 17 Mar 2018 16:59:58 GMT (337kb,D)