Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Viewing counting pol ...
Conference paper

Viewing counting polynomials as Hilbert functions via Ehrhart theory

Felix Breuer (1) (2) (3), Aaron Dall (1) (2) (3)
(1) Freie Universität Berlin
(2) Freie Universität Berlin = Free University of Berlin
(3) Freie Universität Berlin = Free University of Berlin [Berlin]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Proceedings
DOI
10.46298/dmtcs.2871
License
https://about.hal.science/hal-authorisation-v1
Indicators
579
Views
623
Downloads

Viewing counting polynomials as Hilbert functions via Ehrhart theory

Felix Breuer (1) (2) (3), Aaron Dall (1) (2) (3)
(1) Freie Universität Berlin
(2) Freie Universität Berlin = Free University of Berlin
(3) Freie Universität Berlin = Free University of Berlin [Berlin]
Abstract
English
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.
French
Steingrímsson (2001) a montré que le polynôme chromatique d'un graphe est la fonction de Hilbert d'un idéal relatif de Stanley-Reisner. Nous abordons ce résultat du point de vue de la théorie d'Ehrhart et donnons un critère suffisant pour que le polynôme d'Ehrhart d'un complexe polytopal relatif donné soit une fonction de Hilbert au sens de Steingrímsson. Nous utilisons ce résultat pour établir que les polynômes de flux et de tension modulaires et intégraux d'un graphe sont des fonctions de Hilbert.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Hilbert function
  • lattice polytope
  • relative Stanley-Reisner ring
  • tension polynomial
  • flow polynomial
  • relative polytopal complex
Cited by

Source: OpenCitations

  • Hypergraph coloring complexes

    Discrete Mathematics

    Authors : Felix Breuer, Aaron Dall ORCID, Martina Kubitzke

    Journal reference : Volume 312, 2012, pp. 2407-2420

    DOI : 10.1016/j.disc.2012.04.027
Preview
Loading PDF preview...