Counting integer points in higher-dimensional polytopes

DOI10.1007/978-1-4939-7005-6_20MaRDI QIDQ2406337zbMATH OpenOpenAlexFDO

Authors Alexander Barvinok

Publication date 27 September 2017

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

zbMATH Keywords

contingency tableconvex optimizationconvex polytopeinteger latticemaximum entropy principletransportation polytopeanti-concentration inequality

Mathematics Subject Classification ID

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

Recommendations

• On integer points in polyhedra
• Integer points in polyhedra
• Integer points enumerator of hypergraphic polytopes
• Counting integer points of flow polytopes
• Counting integer points in polytopes associated with directed graphs
• The many aspects of counting lattice points in polytopes
• Counting integral points in polytopes via numerical analysis of contour integration
• Enumerating integer points in polytopes with bounded subdeterminants

Cited in

(19)

• Enumerating Collinear Points in Higher Dimensions
• Maximum entropy and integer partitions
• Some estimates for the number of vertices of integer polyhedra
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Counting the Number of Integral Points in General n-Dimensional Tetrahedra and Bernoulli Polynomials
• Counting integer points in polytopes associated with directed graphs
• Durfee squares, symmetric partitions and bounds on Kronecker coefficients
• Counting integer points of flow polytopes
• scientific article; zbMATH DE number 4214137 (Why is no real title available?)
• Counting integral points in polytopes via numerical analysis of contour integration
• Enumerating a subset of the integer points inside a Minkowski sum
• Bounds on Kronecker coefficients via contingency tables
• The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
• Computational complexity of counting coincidences
• Counting integer points in parametric polytopes using Barvinok's rational functions
• On integer points in polyhedra
• Counting polytopes via the Radon complex
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Lower bounds for contingency tables via Lorentzian polynomials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2406337)