Integer Points in Polyhedra — Geometry, Number Theory, Algebra, Optimization.

Intro -- Contents -- Preface -- List of Participants -- A weighted version of quantization commutes with reduction for a toric manifold -- Coefficients and roots of Ehrhart polynomials -- Ehrhart polynomials of lattice polyhedral functions -- Lattice points, contingency tables, and sampling -- Kostka numbers and Littlewood-Richardson coefficients -- Polar decomposition and Brion's theorem -- Gröbner basis degree bounds on Tor·k[Λ](k, k)· and discrete Morse theory for posets -- Integer programming, duality and superadditive functions -- The Cayley trick and triangulations of products of simplices -- Problems from the Cottonwood Room -- Questions about Ehrhart coefficients. -- A conjecture about the Euler characteristic of algebraic varieties over the fields Fq, R, C and the division ring H. -- Lattice points in homogeneously expanding compact domains. -- Reflexive polytopes in dimension 2 and 3, and the numbers 12 and 24. -- Are smooth toric ideals quadratically generated? -- The classification of 1-point lattice tetrahedra. -- A conjecture on lattice tiles. -- Covering minima, free planes and deep holes.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.