The many aspects of counting lattice points in polytopes

DOI10.1007/S00591-005-0094-9zbMATH Open1093.52006OpenAlexW2071108743MaRDI QIDQ2491985FDOQ2491985

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

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

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)

Cites Work

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

Cited In (45)

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

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)