The dynamics of a function family over quadratic extensions of finite fields

Abstract

Let Fq be the finite field with q=ps elements, where p is an odd prime and s a positive integer. In this paper, we define the function f(X)=(cXq+aX)(Xq-X)n-1, for a,c∈Fq and n≥ 1. We study the dynamics of the function f(X) over the finite field Fq2, determining cycle lengths and number of cycles. We also show that all trees attached to cyclic elements are isomorphic, with the exception of the tree hanging from zero. We also present the general shape of such hanging trees, which concludes the complete description of the functional graph of f(X). Let Fq be the finite field with q=ps elements, where p is an odd prime and s a positive integer. In this paper, we analyze the function f(X)=(cXq+aX)(Xq-X)n-1, for a,c∈Fq and n≥ 1. Viewing Fq2 as a two-dimensional vector space over Fq, we obtain an explicit algebraic description of the induced dynamical system. We determine all possible cycle lengths, the exact number of cycles of each length, and give a complete classification of the trees attached to periodic points. The structure of the functional graph is shown to depend explicitly on arithmetic invariants of Fq, including greatest common divisors and multiplicative characters. This provides a complete description of the functional graph of f over Fq2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…