The graph of a family of functions over quadratic extensions of finite fields

Brochero and Teixeira (2023) [4] showed the behavior of the functional graph of f a ( X ) = X q + 1 + a X 2 over quadratic extensions of finite fields explicitly for a ∈ { 1 , − 1 } . In this article, we create a family of functions using repeated iterations of the function f a ( X ) and taking values of a ∈ { 1 , − 1 } in each iteration. Let α be an n -sequence of values for a , taken over { 1 , − 1 } , and f α ( X ) be the resulting function. We present the form of f α ( X ) and use it to derive a closed formula for the number and length of cycles present in the functional graph of f α ( X ) . We then determine the shape of the trees hanging from each cycle and gather all the results in our main theorem.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics
Published
2025-04-03
DOI
https://doi.org/10.1016/j.disc.2025.114500
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The graph of a family of functions over quadratic extensions of finite fields

Daniel Panario, Hugo R. Teixeira, Claude Gravel
Discrete Mathematics
Coding theory and cryptography
article

The graph of a family of functions over quadratic extensions of finite fields

Daniel Panario, Hugo R. Teixeira, Claude Gravel
article en

Abstract

Brochero and Teixeira (2023) [4] showed the behavior of the functional graph of f a ( X ) = X q + 1 + a X 2 over quadratic extensions of finite fields explicitly for a ∈ { 1 , − 1 } . In this article, we create a family of functions using repeated iterations of the function f a ( X ) and taking values of a ∈ { 1 , − 1 } in each iteration. Let α be an n -sequence of values for a , taken over { 1 , − 1 } , and f α ( X ) be the resulting function. We present the form of f α ( X ) and use it to derive a closed formula for the number and length of cycles present in the functional graph of f α ( X ) . We then determine the shape of the trees hanging from each cycle and gather all the results in our main theorem.

Discrete MathematicsVol. 348(8)
Toronto Metropolitan University (CA), Carleton University (CA)
Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 97%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The graph of a family of functions over quadratic extensions of finite fields — Daniel Panario, Hugo R. Teixeira, et al. · Discrete Mathematics (2025) | TGRS Research Map | TGRS