arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.16672math.CO
收藏

有限域上的紧Heffter阵列

Tight Heffter arrays from finite fields

Marco Buratti

摘要:

在将紧Heffter阵列H $(m,n)$的经典概念推广到任何阶为$2mn+1$的群之后,我们给出了初等交换紧Heffter阵列的直接构造,特别是素紧Heffter阵列.如果$q=2mn+1$是一个素数幂,我们说一个初等阿贝尔H $(m,n)$是"在$\mathbb{F}_q$上“,因为对于它的构造,我们利用了$q$阶域的加法和乘法结构。我们表明,在许多情况下,一个直接建设H $(m,n)$在$\mathbb{F}_q$,说$A$,可以很容易地通过实施,$A$具有秩1,并可能是一个丰富的组{ \it乘数},这是元素$u$的$\mathbb{F}_q$,使$u A=A$的行和列的排列。一个H $(m,n)$在$\mathbb{F}_q$上将被称为{ \it optimal},如果它的乘法器组的阶是$m$和$n$的奇数部分的最小公倍数,因为这是它的最大可能阶数。主要结果是一个显式构造的秩一H $(m,n)$ -几乎总是达到最优-对于所有允许的对$(m,n)$,其中存在两个不同的奇素数$p$,$p'$分别划分$m$和$n$。

英文摘要:

After extending the classic notion of a tight Heffter array H$(m,n)$ to any group of order $2mn+1$, we give direct constructions for elementary abelian tight Heffter arrays, hence in particular for prime tight Heffter arrays. If $q=2mn+1$ is a prime power, we say that an elementary abelian H$(m,n)$ is ``over $\mathbb{F}_q$" since, for its construction, we exploit both the additive and multiplicative structure of the field of order $q$. We show that in many cases a direct construction of an H$(m,n)$ over $\mathbb{F}_q$, say $A$, can be obtained very easily by imposing that $A$ has rank 1 and, possibly, a rich group of {\it multipliers}, that are elements $u$ of $\mathbb{F}_q$ such that $u A=A$ up to a permutation of rows and columns. An H$(m,n)$ over $\mathbb{F}_q$ will be said {\it optimal} if the order of its group of multipliers is the least common multiple of the odd parts of $m$ and $n$, since this is the maximum possible order for it. The main result is an explicit construction of a rank-one H$(m,n)$ -- reaching almost always the optimality -- for all admissible pairs $(m,n)$ for which there exist two distinct odd primes $p$, $p'$ dividing $m$ and $n$, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑