Combinatorial Relationship Between Finite Fields and Fixed Points of Functions Going Up and Down
Abstract
We explore a combinatorial bijection between two seemingly unrelated topics: the roots of irreducible polynomials of degree m over a finite field Fp for a prime number p and the number of points that are periodic of order m for a continuous piece-wise linear function gp:[0,1]→[0,1] that goes up and down p times with slope 1/p. We provide a bijection between Fpn and the fixed points of gnp that naturally relates some of the structure in both worlds. Also we extend our result to other families of continuous functions that goes up and down p times, in particular to Chebyshev polynomials, where we get a better understanding of its fixed points. A generalization for other piece-wise linear functions that are not necessarily continuous is also provided.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.