Ham sandwiches, staircases and counting polynomials

[1]  T. Hibi,et al.  Convex polytopes all of whose reverse lexicographic initial ideals are squarefree , 2001 .

[2]  R. Živaljević,et al.  An Extension of the Ham Sandwich Theorem , 1990 .

[3]  K. Deimling.  Fixed Point Theory , 2008 .

[4]  R. Ho.  Algebraic Topology , 2022 .

[5]  Alfredo Hubard,et al.  Slicing Convex Sets and Measures by a Hyperplane , 2008, Discret. Comput. Geom..

[6]  Sinisa T. Vrecica,et al.  Conical equipartitions of mass distributions , 2001, Discret. Comput. Geom..

[7]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[8]  M. Beck,et al.  Dedekind–Carlitz polynomials as lattice-point enumerators in rational polyhedra , 2007, 0710.1323.

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

[10]  Grant Cairns,et al.  Leftovers from the Ham Sandwich Theorem , 2001, Am. Math. Mon..

[11]  Beifang Chen,et al.  Orientations, Lattice Polytopes, and Group Arrangements I: Chromatic and Tension Polynomials of Graphs , 2007, 0706.3273.

[12]  Ivan Stojmenovic,et al.  Bisections and Ham-Sandwich Cuts of Convex Polygons and Polyhedra , 1991, Inf. Process. Lett..

[13]  B. Grünbaum.  Partitions of mass-distributions and of convex bodies by hyperplanes. , 1960 .

[14]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[15]  Ronald L. Graham,et al.  Spectra of Numbers , 1978 .

[16]  J. Tukey,et al.  Generalized “sandwich” theorems , 1942 .

[17]  D. Eisenbud.  Commutative Algebra: with a View Toward Algebraic Geometry , 1995 .

[18]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[19]  Tetsuo Asano,et al.  Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming , 1994, Int. J. Comput. Geom. Appl..

[20]  R. Rado.  A Theorem on General Measure , 1946 .

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

[22]  Richard P. Stanley,et al.  Acyclic orientations of graphs , 1973, Discret. Math..

[23]  Manoj K. Chari.  Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes , 1997 .

[24]  W. A. Beyer,et al.  The Early History of the Ham Sandwich Theorem , 2004, Am. Math. Mon..

[25]  Axel Hultman.  Link complexes of subspace arrangements , 2007, Eur. J. Comb..

[26]  W. T. Tutte,et al.  A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.

[27]  Tom C. Brown,et al.  Descriptions of the Characteristic Sequence of an Irrational , 1993, Canadian Mathematical Bulletin.

[28]  Victor Reiner,et al.  A Convolution Formula for the Tutte Polynomial , 1999, J. Comb. Theory, Ser. B.

[29]  K. O'Bryant.  A Generating Function Technique for Beatty Sequences and Other Step Sequences , 2002 .

[30]  Herbert E. Scarf,et al.  Integral Polyhedra in Three Space , 1985, Math. Oper. Res..

[31]  K. Stolarsky,et al.  Beatty Sequences, Continued Fractions, and Certain Shift Operators , 1976, Canadian Mathematical Bulletin.

[32]  Jesús A. De Loera,et al.  Effective lattice point counting in rational convex polytopes , 2004, J. Symb. Comput..

[33]  Felix Breuer.  Uneven Splitting of Ham Sandwiches , 2010, Discret. Comput. Geom..

[34]  Victor Reiner,et al.  An Interpretation for the Tutte Polynomial , 1999, Eur. J. Comb..

[35]  Emeric Gioan,et al.  Enumerating degree sequences in digraphs and a cycle-cocycle reversing system , 2007, Eur. J. Comb..

[36]  J. D. Loera.  The many aspects of counting lattice points in polytopes , 2005 .

[37]  Sergey Bereg,et al.  Generalizing Ham Sandwich Cuts to Equitable Subdivisions , 1999, SCG '99.

[38]  Thomas Zaslavsky,et al.  The number of nowhere-zero flows on graphs and signed graphs , 2003, J. Comb. Theory, Ser. B.

[39]  Wladyslaw Kulpa,et al.  THE POINCARE-MIRANDA THEOREM , 1997 .

[40]  B. Sturmfels.  Gröbner bases of toric varieties , 1991 .

[41]  B. Sturmfels,et al.  Combinatorial Commutative Algebra , 2004 .

[42]  J. Jonsson.  The Topology of the Coloring Complex , 2005 .

[43]  Aaron Matthew Dall,et al.  THE FLOW AND TENSION COMPLEXES , 2008 .

[44]  M. Kano,et al.  Simultaneous Partitions of Measures by K-fans , 2022 .

[45]  Victor Reiner,et al.  The Koszul property in affine semigroup rings , 1998 .

[46]  Patricia Hersh,et al.  Coloring complexes and arrangements , 2007 .

[47]  A. Fraenkel.  Complementary balanced words over an arbitrary finite alphabet , 2005 .

[48]  Dominique Michelucci,et al.  Convex Hull of Grid Points below a Line or a Convex Curve , 1999, DGCI.

[49]  Thomas Zaslavsky,et al.  Inside-out polytopes , 2003, math/0309330.

[50]  A. S. Fraenkel,et al.  Determination of [nθ] by its Sequence of*Differences , 1978, Canadian Mathematical Bulletin.

[51]  G. Ziegler.  Lectures on Polytopes , 1994 .

[52]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[53]  I. Bárány.  LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .

[54]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[55]  Reinhard Diestel,et al.  Graph Theory , 1997 .

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

[57]  Criel Merino,et al.  Graph Polynomials and Their Applications I: The Tutte Polynomial , 2008, Structural Analysis of Complex Networks.

[58]  Tom Brylawski,et al.  Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .

[59]  Alexander I. Barvinok,et al.  A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed , 1993, FOCS.

[60]  Konrad Zindler.  Über konvexe Gebilde , 1920 .

[61]  Einar Steingrímsson.  The Coloring Ideal and Coloring Complex of a Graph , 2001 .

[62]  Edgar A. Ramos,et al.  Equipartition of mass distributions by hyperplanes , 1996, Discret. Comput. Geom..

[63]  A. Karimi,et al.  Master‟s thesis , 2011 .

[64]  Nimrod Megiddo,et al.  Partitioning with Two Lines in the Plane , 1985, J. Algorithms.

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

[66]  H. Whitney.  The Coloring of Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[67]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[69]  Francesco Brenti,et al.  Hilbert Polynomials in Combinatorics , 1998 .

[70]  Seth Sullivant.  Compressed polytopes and statistical disclosure limitation , 2004 .

[71]  Ferran Hurtado,et al.  On the equipartition of plane convex bodies and convex polygons , 2005 .

[72]  Herbert E. Scarf.  Integral Polyhedra in Three Space , 1985 .

[73]  J. Kincses.  The topological type of the α-sections of convex sets , 2008 .

[74]  P. Rowlinson.  ALGEBRAIC GRAPH THEORY (Graduate Texts in Mathematics 207) By CHRIS GODSIL and GORDON ROYLE: 439 pp., £30.50, ISBN 0-387-95220-9 (Springer, New York, 2001). , 2002 .

[75]  Günter Rote,et al.  On the geometric dilation of closed curves, graphs, and point sets , 2007, Comput. Geom..

[76]  J. Reeve.  On the Volume of Lattice Polyhedra , 1957 .

[77]  V. Dol'nikov,et al.  A generalization of the ham sandwich theorem , 1992 .

[78]  K. Stolarsky,et al.  Half-Silvered Mirrors and Wythoff's Game , 1990, Canadian Mathematical Bulletin.