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