在高斯网络中构造边不交哈密顿环的统一常数时间切换规则
A Unified Constant-Time Switch Rule for Constructing Edge-Disjoint Hamiltonian Cycles in Gaussian Networks
AI总结:
提出统一闭式构造,通过常数时间局部切换规则,为高斯网络生成两个边不交哈密顿环,覆盖所有生成元情况,无需分情况讨论。
摘要:
高斯网络是定义在高斯整数剩余类上的四次对称互连网络。早期工作表明,当生成元 $α=a+bi$ 满足 $\gcd(a,b)=1$ 时,实部和虚部维度直接形成两个边不交的哈密顿环。后来的构造将结果推广到非互质情况 $\gcd(a,b)=d>1$,但其证明使用了长节点序列表和 $d$ 的奇偶分情况。本文给出统一的闭式构造,同时覆盖 $d=1$ 和 $d>1$,以及 $d$ 为奇数和偶数的情况,无需分情况表。在 $d$ 行 $r=(a^2+b^2)/d$ 列的矩形表示中,该构造对每个 $q=1,2,\ldots,d-1$ 在列 $a_q=q-1$ 处使用常数时间局部切换规则。每个切换移除两条水平边并插入两条垂直边。切换后的水平结构形成第一个哈密顿环,其在高斯网络中的边补集形成第二个哈密顿环。因此,完整边集被划分为两个边不交的哈密顿环。该构造需要 $O(d)$ 的切换生成时间和 $O(N)$ 的时间列出两个环,其中 $N=a^2+b^2$。对 $1\leq a\leq b\leq 100$(排除退化的 $N=2$ 网络)的穷举验证以及高达 $N=3{,}250{,}000$ 的大规模验证确认了该构造。
英文摘要:
Gaussian networks are degree-four symmetric interconnection networks defined over residue classes of Gaussian integers. Earlier work showed that when the generator $α=a+bi$ satisfies $\gcd(a,b)=1$, the real and imaginary dimensions directly form two edge-disjoint Hamiltonian cycles. A later construction extended the result to the non-coprime case $\gcd(a,b)=d>1$, but its proof used long node-sequence tables and separate odd/even cases for $d$. This paper gives a unified closed-form construction that covers both $d=1$ and $d>1$, and also covers both odd and even $d$, without separate case tables. In the rectangular representation with $d$ rows and $r=(a^2+b^2)/d$ columns, the construction uses a constant-time local switch rule for each $q=1,2,\ldots,d-1$ at column $a_q=q-1$. Each switch removes two horizontal edges and inserts two vertical edges. The switched horizontal structure forms the first Hamiltonian cycle, while its edge-complement in the Gaussian network forms the second Hamiltonian cycle. Thus, the full edge set is partitioned into two edge-disjoint Hamiltonian cycles. The construction requires $O(d)$ switch-generation time and $O(N)$ time to list the two cycles, where $N=a^2+b^2$. Exhaustive validation for all $1\leq a\leq b\leq 100$, excluding only the degenerate $N=2$ network, and large-scale validation up to $N=3{,}250{,}000$ confirm the construction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。