{"title":"On the sumsets of units and exceptional units in residue class rings","authors":"Siao Hong","doi":"10.1016/j.ffa.2024.102566","DOIUrl":null,"url":null,"abstract":"<div><div>Let <span><math><mi>n</mi><mo>≥</mo><mn>1</mn><mo>,</mo><mi>e</mi><mo>≥</mo><mn>1</mn><mo>,</mo><mi>t</mi><mo>,</mo><mi>k</mi><mo>≥</mo><mn>2</mn></math></span> and <em>c</em> be integers such that <span><math><mn>0</mn><mo>≤</mo><mi>t</mi><mo>≤</mo><mi>k</mi></math></span>. An integer <em>u</em> is called a unit in the ring <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> of residue classes modulo <em>n</em> if <span><math><mi>gcd</mi><mo></mo><mo>(</mo><mi>u</mi><mo>,</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span>. Let <span><math><msubsup><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow><mrow><mo>⁎</mo></mrow></msubsup></math></span> be the multiplicative group of <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. A unit <em>u</em> is called an exceptional unit in the ring <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> if <span><math><mn>1</mn><mo>−</mo><mi>u</mi><mo>∈</mo><msubsup><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow><mrow><mo>⁎</mo></mrow></msubsup></math></span>. We write <span><math><msubsup><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow><mrow><mo>⁎</mo><mo>⁎</mo></mrow></msubsup></math></span> for the set of all exceptional units of <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. We denote by <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mi>e</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> the number of representations of the element <span><math><mi>c</mi><mo>∈</mo><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> as the sum of <em>e</em>-th powers of <em>t</em> units and <em>e</em>-th powers of <span><math><mi>k</mi><mo>−</mo><mi>t</mi></math></span> exceptional units in the ring <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. When <span><math><mi>t</mi><mo>=</mo><mi>k</mi></math></span>, Brauer determined the number <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> which answers a question of Rademacher. Mollahajiaghaei gave a formula for <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mn>2</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span>. When <span><math><mi>t</mi><mo>=</mo><mn>0</mn></math></span>, Sander presented a formula for <span><math><msub><mrow><mi>M</mi></mrow><mrow><mn>0</mn><mo>,</mo><mn>2</mn><mo>,</mo><mi>c</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span>, and later on Yang and Zhao got an exact formula for <span><math><msub><mrow><mi>M</mi></mrow><mrow><mn>0</mn><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span>. However, when <span><math><mn>1</mn><mo>≤</mo><mi>t</mi><mo>≤</mo><mi>k</mi><mo>−</mo><mn>1</mn></math></span>, the formulas for the numbers <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> and <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mn>2</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> are unknown so far. In this paper, we answer this question. In fact, by using algebraic method, Hensel's lemma and exponential sums, we deduce explicit formulas for the numbers <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> and <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>,</mo><mn>2</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> for any integer <em>t</em> with <span><math><mn>0</mn><mo>≤</mo><mi>t</mi><mo>≤</mo><mi>k</mi></math></span>. From this, we derive an exact formula for the number of representations of an element <em>c</em> as the sum of a unit and an exceptional unit in <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. We also obtain an explicit formula for the number of representations of an element <em>c</em> as the sum of square of a unit and square of an exceptional unit in <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. Our result gives a uniform generalization to the theorems of Brauer, of Sander, of Yang and Tang, of Mollahajiaghaei, of Yang and Zhao, and of Feng and Hong.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"103 ","pages":"Article 102566"},"PeriodicalIF":1.2000,"publicationDate":"2025-01-07","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/S1071579724002053","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Let and c be integers such that . An integer u is called a unit in the ring of residue classes modulo n if . Let be the multiplicative group of . A unit u is called an exceptional unit in the ring if . We write for the set of all exceptional units of . We denote by the number of representations of the element as the sum of e-th powers of t units and e-th powers of exceptional units in the ring . When , Brauer determined the number which answers a question of Rademacher. Mollahajiaghaei gave a formula for . When , Sander presented a formula for , and later on Yang and Zhao got an exact formula for . However, when , the formulas for the numbers and are unknown so far. In this paper, we answer this question. In fact, by using algebraic method, Hensel's lemma and exponential sums, we deduce explicit formulas for the numbers and for any integer t with . From this, we derive an exact formula for the number of representations of an element c as the sum of a unit and an exceptional unit in . We also obtain an explicit formula for the number of representations of an element c as the sum of square of a unit and square of an exceptional unit in . Our result gives a uniform generalization to the theorems of Brauer, of Sander, of Yang and Tang, of Mollahajiaghaei, of Yang and Zhao, and of Feng and Hong.
期刊介绍:
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.