Inside-out polytopes

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an integer whose parts are partially distinct, and generalized latin squares. Our method is to generalize Ehrhart's theory of lattice-point counting to a convex polytope dissected by a hyperplane arrangement. We particularly develop the applications to graph and signed-graph coloring, compositions of an integer, and antimagic labellings.

[1]  T. Zaslavsky,et al.  An Enumerative Geometry for Magic and Magilatin Labellings , 2005, math/0506315.

[2]  Andreas Blass,et al.  Characteristic and Ehrhart Polynomials , 1998 .

[3]  E. Ehrhart,et al.  Polynômes arithmétiques et méthode des polyèdres en combinatoire , 1974 .

[4]  Peter McMullen,et al.  Lattice invariant valuations on rational polytopes , 1978 .

[5]  Michelle L. Wachs,et al.  On geometric semilattices , 1985 .

[6]  Thomas Zaslavsky,et al.  ON THE INTERPRETATION OF WHITNEY NUMBERS THROUGH ARRANGEMENTS OF HYPERPLANES, ZONOTOPES, NON-RADON PARTITIONS, AND ORIENTATIONS OF GRAPHS , 1983 .

[7]  Thomas Zaslavsky.  Orientation of Signed Graphs , 1991, Eur. J. Comb..

[8]  Curtis Greenl,et al.  On the Möbius algebra of a partially ordered set , 1973 .

[9]  I. G. MacDonald,et al.  Polynomials Associated with Finite Gell-Complexes , 1971 .

[10]  Louis Solomon,et al.  The Burnside algebra of a finite group , 1967 .

[11]  Thomas A. Dowling,et al.  A class of geometric lattices based on finite groups , 1973 .

[12]  I. Heller,et al.  14 . An Extension of a Theorem of Dantzig’s , 1957 .

[13]  G. Rota.  On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[14]  G. Birkhoff.  A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[15]  Thomas Zaslavsky,et al.  Signed graph coloring , 1982, Discret. Math..

[16]  Richard P. Stanley.  Acyclic orientations of graphs , 1973, Discret. Math..

[17]  I. G. MacDonald,et al.  The volume of a lattice polyhedron , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[18]  Martin Sonntag,et al.  Antimagic vertex labelings of hypergraphs , 2002, Discret. Math..

[19]  H. Whitney.  A logical expansion in mathematics , 1932 .

[20]  T. Zaslavsky.  Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[21]  Martin Kochol,et al.  Polynomials Associated with Nowhere-Zero Flows , 2002, J. Comb. Theory, Ser. B.

[22]  Rainer Bodendiek,et al.  On the relations between certain graph labelings , 1994, Discret. Math..