Effective lattice point counting in rational convex polytopes
From MaRDI portal
(Redirected from Publication:2643564)
Barvinok's algorithmconvex rational polyhedraEhrhart quasi-polynomialsenumeration of lattice pointsgenerating functionslattice pointsrational functions
Exact enumeration problems, generating functions (05A15) 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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Symbolic computation and algebraic computation (68W30)
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
- 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.
- 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?)
- 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
(99)- Ehrhart polynomials of matroid polytopes and polymatroids
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- LattE
- Ehrhart tensor polynomials
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- Counting integer flows in networks
- On the occurrence probability of local binary patterns: a theoretical study
- On the complexity of computing Kronecker coefficients
- Polyhedral circuits and their applications
- Rational polyhedral outer-approximations of the second-order cone
- Computing rational powers of monomial ideals
- Computing the integer hull of convex polyhedral sets
- Sparse representation of vectors in lattices and semigroups
- On lattice point counting in -modular polyhedra
- How to find the convex hull of all integer points in a polyhedron?
- An approximation algorithm for box abstraction of transition systems on real state spaces
- Probabilities of electoral outcomes: from three-candidate to four-candidate elections
- Quantitative static analysis of communication protocols using abstract Markov chains
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws
- 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
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- On Dedekind's problem for complete simple games
- Computing convex hulls and counting integer points with \texttt{polymake}
- Computation of dilated Kronecker coefficients
- Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
- On Ehrhart polynomials and probability calculations in voting theory
- Computing the integer programming gap
- Probability calculations under the IAC hypothesis
- Counting with rational generating functions
- The many aspects of counting lattice points in polytopes
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
- Short rational functions for toric algebra and applications
- The subdivision of large simplicial cones in Normaliz
- MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms
- Lattice point enumeration and applications
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Ehrhart Polynomials and Successive Minima
- Computing points of bounded height in projective space over a number field
- Exact sampling and counting for fixed-margin matrices
- The combinatorics of interval vector polytopes
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- scientific article; zbMATH DE number 1182900 (Why is no real title available?)
- Short rational generating functions for lattice point problems
- An example of probability computations under the IAC assumption: the stability of scoring rules
- scientific article; zbMATH DE number 1559589 (Why is no real title available?)
- Experimental study of the Ehrhart interpolation polytope
- Enumerating projections of integer points in unbounded polyhedra
- A Euclid style algorithm for MacMahon's partition analysis
- Symbolic execution + model counting + entropy maximization = automatic search synthesis
- Polynomial time reachability analysis in discrete state chemical reaction networks obeying conservation laws
- 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
- Enumerating lattice 3-polytopes
- Counting integral points in polytopes via numerical analysis of contour integration
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- Graded Betti numbers of good filtrations
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Computing topological zeta functions of groups, algebras, and modules. I
- Synthetic two-way contingency tables that preserve conditional frequencies
- Armchair or Zigzag? A tool for characterizing graphene edge
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Computing algebraic numbers of bounded height
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- Petri Net Reductions for Counting Markings
- Multi-collinear splitting kernels for track function evolution
- Computing Galois groups of Ehrhart polynomials in OSCAR
- Symmetrically constrained compositions
- On -modular integer linear problems in the canonical form and equivalent problems
- Enhancing SMT-based weighted model integration by structure awareness
- A combinatorial approach to Frobenius numbers of some special sequences
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Counting the integer points of parametric polytopes: a Maple implementation
- Proof of a conjecture on graph polytope
- Beyond Boolean networks: new tools for the steady state analysis of multivalued networks
- External columns and chambers of vector partition functions
- A Polynomial Time Algorithm for Calculating Fourier-Dedekind Sums
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Fast evaluation of generalized Todd polynomials: applications to MacMahon's partition analysis and integer programming
- Counting points with Riemann-Roch formulas
- An algebraic combinatorial approach to Sylvester's denumerant
- Infinite chains in the tree of numerical semigroups
- A fast algorithm for denumerants with three variables
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- Random sampling of contingency tables via probabilistic divide-and-conquer
- Polytope volume by descent in the face lattice and applications in social choice
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Quantifying software reliability via model-counting
- Column basis reduction and decomposable knapsack problems
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Ehrhart series and lattice triangulations
- On the enumeration of certain weighted graphs
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)
