Combinatorial reciprocity theorems

DOI10.1365/S13291-011-0035-6MaRDI QIDQ5894768zbMATH OpenOpenAlexFDO

Authors Matthias Beck

Publication date 3 December 2012

Published in Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

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

zbMATH Keywords

\(P\)-partitionacyclic orientation of a graphchromatic polynomialcombinatorial reciprocity theoremconvex polyhedronEhrhart polynomialEuler-Poincaré relationhyperplane arrangementinside-out polytopelattice pointlattice polytopepermutation statisticsposetrational generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane arrangements, lattice points in polyhedra, proper colorings of graphs, and $P$-partitions. We will see that in each instance we get interesting information out of a counting function when we evaluate it at a emph{negative} integer (and so, a priori the counting function does not make sense at this number). Our goals are to convey some of the charm these "alternative" evaluations of counting functions exhibit, and to weave a unifying thread through various combinatorial reciprocity theorems by looking at them through the lens of geometry, which will include some scenic detours through other combinatorial concepts.

Recommendations

• Combinatorial Reciprocity Theorems
• A bijective proof for a theorem of Ehrhart
• A combinatorial reciprocity theorem for hyperplane arrangements
• An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics
• Inside-out polytopes

Cited in

(11)

• Reciprocity between partitions and compositions
• Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
• Inside-out polytopes
• Order complexes of coset posets of finite groups are not contractible.
• q-analogues of Ehrhart polynomials
• Combinatorial Reciprocity Theorems
• Dimensional reduction for generalized continuum polymers
• scientific article; zbMATH DE number 7120844 (Why is no real title available?)
• Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
• Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
• Combinatorial reciprocity for non-intersecting paths

This page was built for publication: Combinatorial reciprocity theorems

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