{"title":"The graph of a family of functions over quadratic extensions of finite fields","authors":"Claude Gravel , Daniel Panario , Hugo Teixeira","doi":"10.1016/j.disc.2025.114500","DOIUrl":null,"url":null,"abstract":"<div><div>Brochero and Teixeira (2023) <span><span>[4]</span></span> showed the behavior of the functional graph of <span><math><msub><mrow><mi>f</mi></mrow><mrow><mi>a</mi></mrow></msub><mo>(</mo><mi>X</mi><mo>)</mo><mo>=</mo><msup><mrow><mi>X</mi></mrow><mrow><mi>q</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>+</mo><mi>a</mi><msup><mrow><mi>X</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> over quadratic extensions of finite fields explicitly for <span><math><mi>a</mi><mo>∈</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>−</mo><mn>1</mn><mo>}</mo></math></span>. In this article, we create a family of functions using repeated iterations of the function <span><math><msub><mrow><mi>f</mi></mrow><mrow><mi>a</mi></mrow></msub><mo>(</mo><mi>X</mi><mo>)</mo></math></span> and taking values of <span><math><mi>a</mi><mo>∈</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>−</mo><mn>1</mn><mo>}</mo></math></span> in each iteration. Let <em>α</em> be an <em>n</em>-sequence of values for <em>a</em>, taken over <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mo>−</mo><mn>1</mn><mo>}</mo></math></span>, and <span><math><msub><mrow><mi>f</mi></mrow><mrow><mi>α</mi></mrow></msub><mo>(</mo><mi>X</mi><mo>)</mo></math></span> be the resulting function. We present the form of <span><math><msub><mrow><mi>f</mi></mrow><mrow><mi>α</mi></mrow></msub><mo>(</mo><mi>X</mi><mo>)</mo></math></span> and use it to derive a closed formula for the number and length of cycles present in the functional graph of <span><math><msub><mrow><mi>f</mi></mrow><mrow><mi>α</mi></mrow></msub><mo>(</mo><mi>X</mi><mo>)</mo></math></span>. We then determine the shape of the trees hanging from each cycle and gather all the results in our main theorem.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 8","pages":"Article 114500"},"PeriodicalIF":0.7000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25001086","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Brochero and Teixeira (2023) [4] showed the behavior of the functional graph of over quadratic extensions of finite fields explicitly for . In this article, we create a family of functions using repeated iterations of the function and taking values of in each iteration. Let α be an n-sequence of values for a, taken over , and be the resulting function. We present the form of and use it to derive a closed formula for the number and length of cycles present in the functional graph of . We then determine the shape of the trees hanging from each cycle and gather all the results in our main theorem.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.