Counting integer points in higher-dimensional polytopes

DOI10.1007/978-1-4939-7005-6_20zbMath1381.52023OpenAlexW2606709940MaRDI QIDQ2406337

Alexander I. Barvinok

Publication date: 27 September 2017

Full work available at URL: https://doi.org/10.1007/978-1-4939-7005-6_20

zbMATH Keywords

convex optimizationconvex polytopemaximum entropy principlecontingency tableinteger latticetransportation polytopeanti-concentration inequality

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computational aspects related to convexity (52B55) Asymptotic enumeration (05A16)

Related Items (4)

Maximum entropy and integer partitions ⋮ Bounds on Kronecker coefficients via contingency tables ⋮ Durfee squares, symmetric partitions and bounds on Kronecker coefficients ⋮ Lower bounds for contingency tables via Lorentzian polynomials

This page was built for publication: Counting integer points in higher-dimensional polytopes