 |
Discrete Mathematics & Theoretical Computer Science |
Felix Breuer ; Aaron Dall - Viewing counting polynomials as Hilbert functions via Ehrhart theory
dmtcs:2871 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) - https://doi.org/10.46298/dmtcs.2871Viewing counting polynomials as Hilbert functions via Ehrhart theoryArticle
Steingrímsson (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 Steingrímsson's sense. We use this result to establish that the modular and integral flow and tension polynomials of a graph are Hilbert functions.
Source: HAL:hal-01186300v1
Volume: DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: Hilbert function,lattice polytope,relative Stanley-Reisner ring,tension polynomial,flow polynomial,relative polytopal complex,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
1 Document citing this article
Consultation statistics
This page has been seen 237 times.
This article's PDF has been downloaded 260 times.