Inside-out polytopes

DOI10.1016/j.aim.2005.07.006zbMath1107.52009arXivmath/0309330OpenAlexW1978681837MaRDI QIDQ2503362

Publication date: 14 September 2006

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

arrangement of hyperplanes graph colouring valuation antimagic labelling lattice-point counting rational convex polytope antimagic graph antimagic square composition of integer signed graph colouring

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorial aspects of partitions of integers (05A17) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)

Related Items

A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins ⋮ Transfer-matrix methods meet Ehrhart theory ⋮ Biased graphs. VII: Contrabalance and antivoltages ⋮ A Plethora of Polynomials: A Toolbox for Counting Problems ⋮ The number of nowhere-zero flows on graphs and signed graphs ⋮ Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards ⋮ Dualities and reciprocities on graphs on surfaces ⋮ Six signed Petersen graphs, and their automorphisms ⋮ Combinatorics of certain abelian Lie group arrangements and chromatic quasi-polynomials ⋮ Scheduling problems ⋮ Eulerian polynomials for subarrangements of Weyl arrangements ⋮ Bounds on the coefficients of tension and flow polynomials ⋮ Hypergraph coloring complexes ⋮ Periodicity of hyperplane arrangements with integral coefficients modulo positive integers ⋮ Nowhere-harmonic colorings of graphs ⋮ Ehrhart theory, modular flow reciprocity, and the Tutte polynomial ⋮ Möbius conjugation and convolution formulae ⋮ A bivariate chromatic polynomial for signed graphs ⋮ Partially magic labelings and the antimagic graph conjecture ⋮ Partial graph orientations and the Tutte polynomial ⋮ Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials ⋮ Nowhere-zero $\vec{k}$-flows on graphs ⋮ On some polynomials enumerating fully packed loop configurations ⋮ A $q$-queens problem IV. Attacking configurations and their denominators ⋮ Tutte polynomials for directed graphs ⋮ A billiards-like dynamical system for attacking chess pieces ⋮ Polynomial algorithms for canonical forms of orientations ⋮ The flow and tension spaces and lattices of signed graphs ⋮ A $q$-queens problem. I: General theory ⋮ Enumeration of $4 \times 4$ magic squares ⋮ Existence of unimodular triangulations — positive results ⋮ A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders ⋮ Characteristic elements for real hyperplane arrangements ⋮ A q-queens problem. VI. The bishops' period ⋮ Polynomials counting nowhere-zero chains in graphs ⋮ Unlabeled signed graph coloring ⋮ Enumerating colorings, tensions and flows in cell complexes ⋮ Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra

Cites Work