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

特征多项式的界

Bounds on Characteristic Polynomials

Suijie Wang, Yeong-Nan Yeh, Fengwei Zhou

摘要:

假设$G$是一个单图,它有$n$顶点、$m$边和秩$r$。设$χ_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$为$G$的色多项式。对于$q,k\in \Bbb{Z}$和$0\le k\le q+r+1$,我们得到了系数序列的部分二项和的一个尖锐的双边界,即\[ {r+q\choose k}\le \sum_{i=0}^{k}{q\choose k-i}a_{i}\le {m+q\choose k}. \]。事实上,这个界对超平面排列和拟阵的特征多项式成立,它的弱形式可以推广到环面排列和算术拟阵的特征多项式。我们还提出了一个问题的几何解释上的界限。

英文摘要:

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $χ_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side bound for the partial binomial sum of the coefficient sequence, that is, \[ {r+q\choose k}\le \sum_{i=0}^{k}{q\choose k-i}a_{i}\le {m+q\choose k}. \] Indeed, this bound holds for the characteristic polynomial of hyperplane arrangements and matroids, and its weak version can be generalized to the characteristic polynomial of toric arrangements and arithmetic matroids. We also propose a problem on the geometric interpretation of the above bound.

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

↑