arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv math/0601733math.ACmath.CO
收藏

有限连通正则图的特征理想

The characteristic ideal of a finite, connected, regular graph

Josep M. Brunat, Antonio Montes

摘要:

设$Φ(x,y)\in\mathbb{C}[x,y]$为偏次数对称多项式$d$。图$G(Φ)$是以$\mathbb{C}$为顶点集,以$\mathbb{V}(Φ(x,y))$的点为边定义的。本文研究如下问题:给定一个有限连通的$d$ -正则图$H$,求多项式$Φ(x,y)$使得$G(Φ)$有一些连通分支同构于$H$,并且在这种情况下,如果$G(Φ)$有(几乎)所有的分支同构于$H$ .这个问题的解决是通过关联到$H$的一个特征理想,提供了一个新的视角,在以前的论文中制定的猜想,并允许减少其范围。在第二部分中,我们确定了长为$\le 5$的圈和阶为$\le 6$的完全图的特征理想。这一结果为该猜想提供了新的证据。

英文摘要:

Let $Φ(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(Φ)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(Φ(x,y))$ as edges. We study the following problem: given a finite, connected, $d$-regular graph $H$, find the polynomials $Φ(x,y)$ such that $G(Φ)$ has some connected component isomorphic to $H$ and, in this case, if $G(Φ)$ has (almost) all components isomorphic to $H$. The problem is solved by associating to $H$ a characteristic ideal which offers a new perspective to the conjecture formulated in a previous paper, and allows to reduce its scope. In the second part, we determine the characteristic ideal for cycles of lengths $\le 5$ and for complete graphs of order $\le 6$. This results provide new evidence for the conjecture.

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

↑