{"title":"On trivial cyclically covering subspaces of Fqn","authors":"Jing Huang","doi":"10.1016/j.ffa.2024.102423","DOIUrl":null,"url":null,"abstract":"<div><p>A subspace of <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msubsup></math></span> is called a cyclically covering subspace if for every vector of <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msubsup></math></span>, operating a certain number of cyclic shifts on it, the resulting vector lies in the subspace. In this paper, we study the problem of under what conditions <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msubsup></math></span> is itself the only covering subspace of <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msubsup></math></span>, symbolically, <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span>, which is an open problem posed in Cameron et al. (2019) <span>[3]</span> and Aaronson et al. (2021) <span>[1]</span>. We apply the primitive idempotents of the cyclic group algebra to attack this problem; when <em>q</em> is relatively prime to <em>n</em>, we obtain a necessary and sufficient condition under which <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span>, which completely answers the problem in this case. Our main result reveals that the problem can be fully reduced to that of determining the values of the trace function over finite fields. As consequences, we explicitly determine several infinitely families of <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msubsup></math></span> which satisfy <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span>.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2024-03-29","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/S1071579724000625","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
A subspace of is called a cyclically covering subspace if for every vector of , operating a certain number of cyclic shifts on it, the resulting vector lies in the subspace. In this paper, we study the problem of under what conditions is itself the only covering subspace of , symbolically, , which is an open problem posed in Cameron et al. (2019) [3] and Aaronson et al. (2021) [1]. We apply the primitive idempotents of the cyclic group algebra to attack this problem; when q is relatively prime to n, we obtain a necessary and sufficient condition under which , which completely answers the problem in this case. Our main result reveals that the problem can be fully reduced to that of determining the values of the trace function over finite fields. As consequences, we explicitly determine several infinitely families of which satisfy .
期刊介绍:
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.