{"title":"Heffter spaces","authors":"M. Buratti , A. Pasotti","doi":"10.1016/j.ffa.2024.102464","DOIUrl":null,"url":null,"abstract":"<div><p>The notion of a Heffter array, which received much attention in the last decade, is equivalent to a pair of orthogonal Heffter systems. In this paper we study the existence problem of a set of <em>r</em> mutually orthogonal Heffter systems for any <em>r</em>. Such a set is equivalent to a resolvable partial linear space of degree <em>r</em> whose parallel classes are Heffter systems: this is a new combinatorial design that we call a <em>Heffter space</em>. We present a series of direct constructions of Heffter spaces with odd block size and arbitrarily large degree <em>r</em> obtained with the crucial use of finite fields. Among the applications we establish, in particular, that if <span><math><mi>q</mi><mo>=</mo><mn>2</mn><mi>k</mi><mi>w</mi><mo>+</mo><mn>1</mn></math></span> is a prime power with <em>kw</em> odd and <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span>, then there are at least <span><math><mo>⌈</mo><mfrac><mrow><mi>w</mi></mrow><mrow><mn>4</mn><msup><mrow><mi>k</mi></mrow><mrow><mn>4</mn></mrow></msup></mrow></mfrac><mo>⌉</mo></math></span> mutually orthogonal <em>k</em>-cycle systems of order <em>q</em>.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2024-07-08","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/S1071579724001035","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The notion of a Heffter array, which received much attention in the last decade, is equivalent to a pair of orthogonal Heffter systems. In this paper we study the existence problem of a set of r mutually orthogonal Heffter systems for any r. Such a set is equivalent to a resolvable partial linear space of degree r whose parallel classes are Heffter systems: this is a new combinatorial design that we call a Heffter space. We present a series of direct constructions of Heffter spaces with odd block size and arbitrarily large degree r obtained with the crucial use of finite fields. Among the applications we establish, in particular, that if is a prime power with kw odd and , then there are at least mutually orthogonal k-cycle systems of order q.
赫夫特阵列的概念在过去十年中备受关注,它等价于一对正交赫夫特系统。在本文中,我们研究了任意 r 的 r 个相互正交的赫夫特系统集合的存在性问题。这样的集合等价于一个度数为 r 的可解析偏线性空间,其并行类是赫夫特系统:这是一种新的组合设计,我们称之为赫夫特空间。我们介绍了一系列直接构造的赫夫特空间,这些空间具有奇数块大小和任意大的度数 r,是利用有限域获得的。在这些应用中,我们特别指出,如果 q=2kw+1 是 kw 为奇数且 k≥3 的素数幂,那么至少有 ⌈w4k4⌉ 个相互正交的 q 阶 k 循环系统。
期刊介绍:
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.