Skip to Main content Skip to Navigation
Conference papers

Viewing counting polynomials as Hilbert functions via Ehrhart theory

Abstract : 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.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 24, 2015 - 3:48:46 PM
Last modification on : Thursday, January 6, 2022 - 12:14:04 PM
Long-term archiving on: : Wednesday, November 25, 2015 - 5:57:52 PM


Publisher files allowed on an open archive




Felix Breuer, Aaron Dall. Viewing counting polynomials as Hilbert functions via Ehrhart theory. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.545-556, ⟨10.46298/dmtcs.2871⟩. ⟨hal-01186300⟩



Record views


Files downloads