{"title":"Multiplicative character sums over two classes of subsets of quadratic extensions of finite fields","authors":"Kaimin Cheng , Arne Winterhof","doi":"10.1016/j.ffa.2025.102767","DOIUrl":null,"url":null,"abstract":"<div><div>Let <em>q</em> be a prime power and <em>r</em> a positive even integer. Let <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> be the finite field with <em>q</em> elements and <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi></mrow></msup></mrow></msub></math></span> be its extension field of degree <em>r</em>. Let <em>χ</em> be a nontrivial multiplicative character of <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi></mrow></msup></mrow></msub></math></span> and <span><math><mi>f</mi><mo>(</mo><mi>X</mi><mo>)</mo></math></span> a polynomial over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi></mrow></msup></mrow></msub></math></span> with exactly one simple root in <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi></mrow></msup></mrow></msub></math></span>. In this paper, we improve estimates for character sums <span><math><munder><mo>∑</mo><mrow><mi>g</mi><mo>∈</mo><mi>G</mi></mrow></munder><mi>χ</mi><mo>(</mo><mi>f</mi><mo>(</mo><mi>g</mi><mo>)</mo><mo>)</mo></math></span>, where <span><math><mi>G</mi></math></span> is either a subset of <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi></mrow></msup></mrow></msub></math></span> of sparse elements, with respect to some fixed basis of <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi></mrow></msup></mrow></msub></math></span> which contains a basis of <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi><mo>/</mo><mn>2</mn></mrow></msup></mrow></msub></math></span>, or a subset avoiding affine hyperplanes in general position. While such sums have been previously studied, our approach yields sharper bounds by reducing them to sums over the subfield <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>r</mi><mo>/</mo><mn>2</mn></mrow></msup></mrow></msub></math></span> rather than sums over general linear spaces. These estimates can be used to prove the existence of primitive elements in <span><math><mi>G</mi></math></span> in the standard way.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"111 ","pages":"Article 102767"},"PeriodicalIF":1.3000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725001972","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/12/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Let q be a prime power and r a positive even integer. Let be the finite field with q elements and be its extension field of degree r. Let χ be a nontrivial multiplicative character of and a polynomial over with exactly one simple root in . In this paper, we improve estimates for character sums , where is either a subset of of sparse elements, with respect to some fixed basis of which contains a basis of , or a subset avoiding affine hyperplanes in general position. While such sums have been previously studied, our approach yields sharper bounds by reducing them to sums over the subfield rather than sums over general linear spaces. These estimates can be used to prove the existence of primitive elements in in the standard way.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.