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

相互正交循环系统

Mutually orthogonal cycle systems

Andrea C. Burgess, Nicholas J. Cavenagh, David A. Pike

摘要:

图$Γ$的${\ell}$ -圈系统${\mathcal F}$是划分$Γ$的边集的${\ell}$ -圈的集合.如果来自${\mathcal F}\cup {\mathcal F}'$的两个不同的循环不共享多于一个的边,则两个这样的循环系统${\mathcal F}$和${\mathcal F}'$被称为{ \em正交}。正交循环系统自然地产生于面$2$ -Colonial polyhdra,并且在更高的亏格中产生于具有一定序的Heffter阵列。$Γ$的一组成对正交的$\ell$ -循环系统称为$Γ$的一组相互正交的循环系统。令$μ(\ell,n)$(分别为$μ'(\ell,n)$)是最大整数$μ$,使得存在一组$μ$相互正交(循环)的$\ell$ -循环系统的完全图$K_n$。我们表明,如果$\ell\geq 4$是甚至和$n\equiv 1\pmod{2\ell}$,然后$μ'(\ell,n)$,因此$μ(\ell,n)$,是有界的$n/\ell^2$的一个常数倍以下。相比之下,我们得到以下上界:$μ(\ell,n)\leq n-2$ ;当$\ell \geq 4$时,$μ(\ell,n)\leq (n-2)(n-3)/(2(\ell-3))$;当$\ell>n/\sqrt{2}$时,$μ(\ell,n)\leq 1$;当$n \geq 4$时,$μ'(\ell,n)\leq n-3$。我们还获得了小值的$n$和$\ell$的计算结果。

英文摘要:

An ${\ell}$-cycle system ${\mathcal F}$ of a graph $Γ$ is a set of ${\ell}$-cycles which partition the edge set of $Γ$. Two such cycle systems ${\mathcal F}$ and ${\mathcal F}'$ are said to be {\em orthogonal} if no two distinct cycles from ${\mathcal F}\cup {\mathcal F}'$ share more than one edge. Orthogonal cycle systems naturally arise from face $2$-colourable polyehdra and in higher genus from Heffter arrays with certain orderings. A set of pairwise orthogonal $\ell$-cycle systems of $Γ$ is said to be a set of mutually orthogonal cycle systems of $Γ$. Let $μ(\ell,n)$ (respectively, $μ'(\ell,n)$) be the maximum integer $μ$ such that there exists a set of $μ$ mutually orthogonal (cyclic) $\ell$-cycle systems of the complete graph $K_n$. We show that if $\ell\geq 4$ is even and $n\equiv 1\pmod{2\ell}$, then $μ'(\ell,n)$, and hence $μ(\ell,n)$, is bounded below by a constant multiple of $n/\ell^2$. In contrast, we obtain the following upper bounds: $μ(\ell,n)\leq n-2$; $μ(\ell,n)\leq (n-2)(n-3)/(2(\ell-3))$ when $\ell \geq 4$; $μ(\ell,n)\leq 1$ when $\ell>n/\sqrt{2}$; and $μ'(\ell,n)\leq n-3$ when $n \geq 4$. We also obtain computational results for small values of $n$ and $\ell$.

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

↑