An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics

DOI10.1007/978-3-319-15081-9_1zbMATH Open1437.52010arXiv1405.7647OpenAlexW4480325MaRDI QIDQ2808002FDOQ2808002

Felix Breuer

Publication date: 25 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in combinatorics, Ehrhart's method for proving that a couting function is a polynomial, the connection between polyhedral cones, rational functions and quasisymmetric functions, methods for bounding coefficients, combinatorial reciprocity theorems, algorithms for counting integer points in polyhedra and computing rational function representations, as well as visualizations of the greatest common divisor and the Euclidean algorithm.

Full work available at URL: https://arxiv.org/abs/1405.7647

Recommendations

• Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley
• An invitation to modern enumerative geometry
• Combinatorial Reciprocity Theorems
• scientific article; zbMATH DE number 437624
• Combinatorial geometries, convex polyhedra, and Schubert cells
• scientific article; zbMATH DE number 665689
• Triangulations of integral polytopes and Ehrhart polynomials
• Excursions into combinatorial geometry
• Incidence geometry in combinatorial arithmetic in memoriam of György Elekes
• scientific article; zbMATH DE number 4187465

zbMATH Keywords

generating functionEuclidean algorithmformal power seriesinteger linear programmingpolynomialrational functionBarvinok's algorithmgreatest common divisorquasipolynomialquasisymmetric functionsimplicial conecombinatorial reciprocity theorempartial polytopal complexfundamental parallelepiped

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Polynomials in number theory (11C08) Combinatorial aspects of partitions of integers (05A17) Polynomials and finite commutative rings (13M10)

Cited In (11)

• Title not available (Why is that?)
• Mini-workshop: Ehrhart quasipolynomials: Algebra, combinatorics, and geometry
• A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins
• Tutte polynomials for regular oriented matroids
• Quasipolynomials and maximal coefficients of Gaussian polynomials
• Computing the Continuous Discretely
• From Gehrlein-Fishburn’s Method on Frequency Representation to a Direct Proof of Ehrhart’s extended Conjecture
• Combinatorial Reciprocity Theorems
• Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts
• Inside-out polytopes
• An invitation to modern enumerative geometry

This page was built for publication: An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808002)