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

分圆图与完美码

Cyclotomic graphs and perfect codes

Sanming Zhou

摘要:

本文研究了两类分圆图及其完美码。它们是$\mathbb{Z}[ζ_m]/A$的可加群上的Cayley图,分别具有连接集$\{\pm (ζ_m^i + A): 0 \le i \le m-1\}$和$\{\pm (ζ_m^i + A): 0 \le i \le ϕ(m) - 1\}$,其中$ζ_m$($m \ge 2$)是$m$的单位原根,$A$是$\mathbb{Z}[ζ_m]$的非零理想,$ϕ$是Euler的顶点函数.我们称它们为$m$次分圆图和第二类$m$次分圆图,分别用$G_{m}(A)$和$G^*_{m}(A)$表示.本文给出了$D/A$是$G^*_{m}(A)$中完美$t$码的充要条件和$D/A$是$G_{m}(A)$中完美$t$码的必要条件,其中$t \ge 1$是整数,$D$是$\mathbb{Z}[ζ_m]$的含$A$的理想.在$m = 3, 4$,$G_m((α))$分别为Eisenstein-Jacobi和Gaussian网络的情况下,我们得到了$(β)/(α)$是$G_m((α))$中完美$t$码的必要条件,其中$0 \ne α, β\in \mathbb{Z}[ζ_m]$与$β$整除$α$ .在文献中,已知当$m=4$和$m=3$在附加条件下时,这样的条件是充分的。本文对$2p$的第一类Frobenius循环图进行了分类,并证明了它们都是$p$次分圆图,其中$p$是奇素数.这样的图属于一个大家族的凯莱图,是有效的路由和八卦。

英文摘要:

We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of $\mathbb{Z}[ζ_m]/A$, with connection sets $\{\pm (ζ_m^i + A): 0 \le i \le m-1\}$ and $\{\pm (ζ_m^i + A): 0 \le i \le ϕ(m) - 1\}$, respectively, where $ζ_m$ ($m \ge 2$) is an $m$th primitive root of unity, $A$ a nonzero ideal of $\mathbb{Z}[ζ_m]$, and $ϕ$ Euler's totient function. We call them the $m$th cyclotomic graph and the second kind $m$th cyclotomic graph, and denote them by $G_{m}(A)$ and $G^*_{m}(A)$, respectively. We give a necessary and sufficient condition for $D/A$ to be a perfect $t$-code in $G^*_{m}(A)$ and a necessary condition for $D/A$ to be such a code in $G_{m}(A)$, where $t \ge 1$ is an integer and $D$ an ideal of $\mathbb{Z}[ζ_m]$ containing $A$. In the case when $m = 3, 4$, $G_m((α))$ is known as an Eisenstein-Jacobi and Gaussian networks, respectively, and we obtain necessary conditions for $(β)/(α)$ to be a perfect $t$-code in $G_m((α))$, where $0 \ne α, β\in \mathbb{Z}[ζ_m]$ with $β$ dividing $α$. In the literature such conditions are known to be sufficient when $m=4$ and $m=3$ under an additional condition. We give a classification of all first kind Frobenius circulants of valency $2p$ and prove that they are all $p$th cyclotomic graphs, where $p$ is an odd prime. Such graphs belong to a large family of Cayley graphs that are efficient for routing and gossiping.

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

↑