The many aspects of counting lattice points in polytopes

DOI10.1007/S00591-005-0094-9MaRDI QIDQ2491985zbMATH OpenOpenAlexFDO

Authors Jesús A. De Loera

Publication date 31 May 2006

Published in Mathematische Semesterberichte (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00591-005-0094-9

zbMATH Keywords

network flowsrational polytopeknapsack problemslattice pointtransportation polytopeBarvinok's algorithmGelfand-Tsetlin patternEhrhart quasipolynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice points in specified regions (11P21)

Recommendations

• Effective lattice point counting in rational convex polytopes
• An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
• A Primal Barvinok Algorithm Based on Irrational Decompositions
• On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
• Counting lattice points of rational polyhedra
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• A closer look at lattice points in rational simplices
• scientific article; zbMATH DE number 3921383

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 51906 (Why is no real title available?)
• scientific article; zbMATH DE number 3592969 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 683826 (Why is no real title available?)
• scientific article; zbMATH DE number 1057883 (Why is no real title available?)
• scientific article; zbMATH DE number 2050721 (Why is no real title available?)
• scientific article; zbMATH DE number 2086933 (Why is no real title available?)
• scientific article; zbMATH DE number 1860211 (Why is no real title available?)
• scientific article; zbMATH DE number 795108 (Why is no real title available?)
• scientific article; zbMATH DE number 798657 (Why is no real title available?)
• scientific article; zbMATH DE number 898426 (Why is no real title available?)
• scientific article; zbMATH DE number 928873 (Why is no real title available?)
• scientific article; zbMATH DE number 1405493 (Why is no real title available?)
• scientific article; zbMATH DE number 2209709 (Why is no real title available?)
• scientific article; zbMATH DE number 2223032 (Why is no real title available?)
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• A Short Proof of Jacobi's Formula for the Number of Representations of an Integer as a Sum of Four Squares
• A lower bound theorem for Ehrhart polynomials of convex polytopes
• A vector partition function for the multiplicities of \(\mathfrak{sl}_k\mathbb C\)
• Asymptotics of multivariate sequences. I: Smooth points of the singular variety
• Classification of Quantifier Prefixes Over Diophantine Equations
• Combinatorial remarks on partitions of a multipartite number
• Counting integer flows in networks
• Counting lattice points by means of the residue theorem
• Decompositions of Rational Convex Polytopes
• Effective lattice point counting in rational convex polytopes
• Lattice points in lattice polytopes
• Lectures on Polytopes
• On Counting Integral Points in a Convex Rational Polytope
• On vector partition functions
• Pick's theorem and the Todd class of a toric variety
• Points entiers dans les polyèdres convexes
• Polynomials Associated with Finite Gell-Complexes
• Precise data locality optimization of nested loops
• Residue formulae for vector partitions and Euler-Maclaurin sums.
• Residue formulae, vector partition functions and lattice points in rational polytopes
• Sampling contingency tables
• Short rational functions for toric algebra and applications
• Short rational generating functions for lattice point problems
• Tensor product multiplicities, canonical and totally positive varieties
• The Ehrhart polynomial of a lattice polytope
• The Ehrhart polynomial of the Birkhoff polytope
• The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
• The honeycomb model of 𝐺𝐿_{𝑛}(ℂ) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone
• The minimum period of the Ehrhart quasi-polynomial of a rational polytope
• Two poset polytopes
• Vertices of Gelfand-Tsetlin polytopes

Cited in

(55)

• Counting polytopes via the Radon complex
• Inside-out polytopes
• The value function of a transportation problem
• scientific article; zbMATH DE number 2223040 (Why is no real title available?)
• Solving a sparse system using linear algebra
• On Counting Lattice Points in Polyhedra
• On polynomials counting essentially irreducible maps
• Covering lattice points by subspaces and counting point-hyperplane incidences
• Group-theoretic dimension of stationary symmetric \(\alpha\)-stable random fields
• On Counting Integral Points in a Convex Rational Polytope
• Estimates of the Pythagoras number of \(\mathbb R_m[x_1, \ldots , x_n]\) through lattice points and polytopes
• Stationary symmetric \(\alpha\)-stable discrete parameter random fields
• Elementary geometry on the integer lattice
• Effective lattice point counting in rational convex polytopes
• Integer points in polyhedra
• Counting integer points in higher-dimensional polytopes
• A billiards-like dynamical system for attacking chess pieces
• On Dedekind's problem for complete simple games
• Exploiting symmetries in polyhedral computations
• The characterisation problem of Ehrhart polynomials of lattice polytopes
• Experimental study of the Ehrhart interpolation polytope
• Coprime Ehrhart Theory and Counting Free Segments
• Computing convex hulls and counting integer points with \texttt{polymake}
• The general formula for the Ehrhart polynomial of polytopes with applications
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• Computing Galois groups of Ehrhart polynomials in OSCAR
• Simple Explicit Formula for Counting Lattice Points of Polyhedra
• scientific article; zbMATH DE number 1512139 (Why is no real title available?)
• Approximating the volume of tropical polytopes is difficult
• Probability calculations under the IAC hypothesis
• Transfer-matrix methods meet Ehrhart theory
• scientific article; zbMATH DE number 5222518 (Why is no real title available?)
• Splines, lattice points, and arithmetic matroids
• Ehrhart series and lattice triangulations
• Existence of unimodular triangulations -- positive results
• A plethora of polynomials: a toolbox for counting problems
• Chern-Simons theory, Ehrhart polynomials, and representation theory
• Ergodic theory, abelian groups and point processes induced by stable random fields
• scientific article; zbMATH DE number 1405493 (Why is no real title available?)
• Continous analogues for the binomial coefficients and the Catalan numbers
• scientific article; zbMATH DE number 1996253 (Why is no real title available?)
• Let me tell you my favorite lattice-point problem \dots
• An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
• Counting integral points in polytopes via numerical analysis of contour integration
• Maxima of stable random fields, nonsingular actions and finitely generated abelian groups: a survey
• A Euclid style algorithm for MacMahon's partition analysis
• On the occurrence probability of local binary patterns: a theoretical study
• On the parameters of \(r\)-dimensional toric codes
• Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• The number of closed essential surfaces in Montesinos knots with four rational tangles
• Threshold functions and Poisson convergence for systems of equations in random sets
• Quasi-polynomials, linear Diophantine equations and semi-linear sets
• Computing Optimized Path Integrals for Knapsack Feasibility
• Counting lattice points in free sums of polytopes

Describes a project that uses

Uses Software

• LattE

This page was built for publication: The many aspects of counting lattice points in polytopes

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