Inside-out polytopes (Q2503362)

The core idea of this paper is a generalization of Ehrhart's theory of lattice-point counting to facially weighted enumerations of an inside-out polytope \((P,{\mathcal H})\), which is a pair is consisting of a convex polytope \(P\) dissected by a hyperplane arrangement \({\mathcal H}\). In particular, Ehrhart's reciprocity theorem corresponds to results on valuations involving Möbius functions. This provides a common approach to, for example, graph and signed-graph colourings, flows on graphs, magic and antimagic squares and graphs, latin squares and decompositions of integers.