Effective lattice point counting in rational convex polytopes
From MaRDI portal
Publication:2643564
lattice pointsgenerating functionsrational functionsBarvinok's algorithmEhrhart quasi-polynomialsconvex rational polyhedraenumeration of lattice points
Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)
Recommendations
- The many aspects of counting lattice points in polytopes
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Computing convex hulls and counting integer points with \texttt{polymake}
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1187155 (Why is no real title available?)
- scientific article; zbMATH DE number 66683 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3539278 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1182907 (Why is no real title available?)
- scientific article; zbMATH DE number 2086933 (Why is no real title available?)
- scientific article; zbMATH DE number 1860733 (Why is no real title available?)
- scientific article; zbMATH DE number 795108 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 1391661 (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?)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Algebraic unimodular counting
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- Asymptotics of multivariate sequences. I: Smooth points of the singular variety
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
- Counting lattice points by means of the residue theorem
- Decompositions of Rational Convex Polytopes
- Fast Unimodular Counting
- Geometric algorithms and combinatorial optimization.
- Integer Programming with a Fixed Number of Variables
- Non-standard approaches to integer programming
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- Points entiers dans les polyèdres convexes
- Representations of integers by linear forms in nonnegative integers
- Short rational functions for toric algebra and applications
- Short rational generating functions for lattice point problems
- Solving the knapsack problem via \(\mathbb Z\)-transform
- The Ehrhart polynomial of the Birkhoff polytope
- The Generalized Basis Reduction Algorithm
- The Kostant partition function for simple Lie algebras
- Ubiquity of Kostka polynomials
Cited in
(88)- Quantitative static analysis of communication protocols using abstract Markov chains
- MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms
- Ehrhart tensor polynomials
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
- The subdivision of large simplicial cones in Normaliz
- Computation of dilated Kronecker coefficients
- Counting integer flows in networks
- Counting with rational generating functions
- Polyhedral circuits and their applications
- Rational polyhedral outer-approximations of the second-order cone
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Quantifying software reliability via model-counting
- Sparse representation of vectors in lattices and semigroups
- On Ehrhart polynomials and probability calculations in voting theory
- On Dedekind's problem for complete simple games
- Symmetrically constrained compositions
- Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
- Computing the integer programming gap
- Polytope volume by descent in the face lattice and applications in social choice
- Computing the integer hull of convex polyhedral sets
- Polynomial time reachability analysis in discrete state chemical reaction networks obeying conservation laws
- On the complexity of computing Kronecker coefficients
- The combinatorics of interval vector polytopes
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Computing convex hulls and counting integer points with \texttt{polymake}
- Synthetic two-way contingency tables that preserve conditional frequencies
- Ehrhart polynomials of matroid polytopes and polymatroids
- scientific article; zbMATH DE number 1559589 (Why is no real title available?)
- Exact sampling and counting for fixed-margin matrices
- Lattice point enumeration and applications
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Petri Net Reductions for Counting Markings
- On lattice point counting in \(\varDelta\)-modular polyhedra
- Probability calculations under the IAC hypothesis
- LattE
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- The many aspects of counting lattice points in polytopes
- Computing topological zeta functions of groups, algebras, and modules. I
- Ehrhart series and lattice triangulations
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- Probabilities of electoral outcomes: from three-candidate to four-candidate elections
- Computing algebraic numbers of bounded height
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Ehrhart Polynomials and Successive Minima
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- Counting integral points in polytopes via numerical analysis of contour integration
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- A Euclid style algorithm for MacMahon's partition analysis
- On the occurrence probability of local binary patterns: a theoretical study
- Computing rational powers of monomial ideals
- An example of probability computations under the IAC assumption: the stability of scoring rules
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Column basis reduction and decomposable knapsack problems
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- Enumerating lattice 3-polytopes
- Enumerating projections of integer points in unbounded polyhedra
- Short rational generating functions for lattice point problems
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Armchair or Zigzag? A tool for characterizing graphene edge
- Random sampling of contingency tables via probabilistic divide-and-conquer
- On the enumeration of certain weighted graphs
- Short rational functions for toric algebra and applications
- How to find the convex hull of all integer points in a polyhedron?
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws
- Enhancing SMT-based weighted model integration by structure awareness
- Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox
- Exploring the No-Show Paradox for Condorcet Extensions
- IAC Probability Calculations in Voting Theory: Progress Report
- A chaotic lattice field theory in one dimension
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
- Multi-collinear splitting kernels for track function evolution
- Experimental study of the Ehrhart interpolation polytope
- An approximation algorithm for box abstraction of transition systems on real state spaces
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
- Computing Galois groups of Ehrhart polynomials in OSCAR
- Graded Betti numbers of good filtrations
- Computing points of bounded height in projective space over a number field
- Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- A combinatorial approach to Frobenius numbers of some special sequences
- scientific article; zbMATH DE number 7455740 (Why is no real title available?)
- Counting the integer points of parametric polytopes: a Maple implementation
This page was built for publication: Effective lattice point counting in rational convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643564)
