Viewing counting polynomials as Hilbert functions via Ehrhart theory
Discrete Mathematics & Theoretical Computer Science(2010)
摘要
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the
Hilbert function of a relative Stanley-Reisner ideal. We approach this result
from the point of view of Ehrhart theory and give a sufficient criterion for
when the Ehrhart polynomial of a given relative polytopal complex is a Hilbert
function in Steingrimsson's sense. We use this result to establish that the
modular and integral flow and tension polynomials of a graph are Hilbert
functions.
更多查看译文
关键词
hilbert function,chromatic polynomial,ehrhart polynomial
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要