35 research outputs found
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.Comment: 24 pages, 3 figures; to appear in Adv. Mat
Affine and toric hyperplane arrangements
We extend the Billera-Ehrenborg-Readdy map between the intersection lattice
and face lattice of a central hyperplane arrangement to affine and toric
hyperplane arrangements. For arrangements on the torus, we also generalize
Zaslavsky's fundamental results on the number of regions.Comment: 32 pages, 4 figure
Topology of Arrangements and Representation Stability
The workshop “Topology of arrangements and representation stability” brought together two directions of research: the topology and geometry of hyperplane, toric and elliptic arrangements, and the homological and representation stability of configuration spaces and related families of spaces and discrete groups. The participants were mathematicians working at the interface between several very active areas of research in topology, geometry, algebra, representation theory, and combinatorics. The workshop provided a thorough overview of current developments, highlighted significant progress in the field, and fostered an increasing amount of interaction between specialists in areas of research
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application