scientific article; zbMATH DE number 1405493
From MaRDI portal
Publication:4938470
The paper is an extensive survey on counting the number of integer points in rational polyhedra. The survey is focused on the issue of the algorithmic complexity of counting or computing the corresponding generating function. Valuations, classical and higher-dimensional Dedekind sums, complexity of the Presburger arithmetic, connections with the theory of toric varieties come into play. For the entire collection see [Zbl 0927.00011].
Recommendations
Cited in
(only showing first 100 items - show all)- The unexpected behavior of plurality rule
- Ehrhart polynomials of matroid polytopes and polymatroids
- An algorithm reconstructing convex lattice sets.
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Evaluation of Dedekind sums, Eisenstein cocycles, and special values of \(L\)-functions
- La valeur optimale des programmes entiers. (The optimal value of integer programs)
- Enumerating a subset of the integer points inside a Minkowski sum
- Computing weight \(q\)-multiplicities for the representations of the simple Lie algebras
- Short rational generating functions for solving some families of fuzzy integer programming problems
- Model checking the evolution of gene regulatory networks
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- A quantitative Doignon-Bell-Scarf theorem
- A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures
- Sparsity in sums of squares of polynomials
- On approximation algorithms for concave mixed-integer quadratic programming
- A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement
- On a valuation of rational subsets of \(Z^{k}\)
- Solving the knapsack problem via \(\mathbb Z\)-transform
- Sharp polynomial estimate of integral points in right-angled simplices
- Counting chemical compositions using Ehrhart quasi-polynomials
- Berline-Vergne valuation and generalized permutohedra
- On the complexity of computing Kronecker coefficients
- Majority properties of positional social preference correspondences
- Sparse representation of vectors in lattices and semigroups
- On lattice point counting in -modular polyhedra
- Distances to lattice points in knapsack polyhedra
- On the number of integer points in translated and expanded polyhedra
- Linear recurrence relations in \(q\)-systems via lattice points in polyhedra
- Bivariate dimension quasi-polynomials of difference-differential field extensions with weighted basic operators
- Difference dimension quasi-polynomials
- Exact Euler-Maclaurin formulas for simple lattice polytopes
- Generating functions and duality for integer programs
- A discrete Farkas lemma
- Enumeration of integer points in projections of unbounded polyhedra
- On Ehrhart polynomials and probability calculations in voting theory
- Ehrhart theory of polytopes and Seiberg-Witten invariants of plumbed 3-manifolds
- Computing the integer programming gap
- 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
- A rainbow Ramsey analogue of Rado's theorem
- Short rational functions for toric algebra and applications
- Effective lattice point counting in rational convex polytopes
- Steinhaus' lattice point problem for polyhedra
- Faster geometric algorithms via dynamic determinant computation
- Sum-integral interpolators and the Euler-Maclaurin formula for polytopes
- Algorithms for the frame of a finitely generated unbounded polyhedron
- MacMahon’s Dream
- Correlation, partitioning and the probability of casting a decisive vote under the majority rule
- Complexity of short generating functions
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- An algebraic-perturbation variant of Barvinok's algorithm
- Concrete polytopes may not tile the space
- Computing points of bounded height in projective space over a number field
- Bias expansion of spatial statistics and approximation of differenced lattice point counts
- scientific article; zbMATH DE number 3924871 (Why is no real title available?)
- Implicitization of curves and (hyper)surfaces using predicted support
- Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley
- The unreasonable ubiquitousness of quasi-polynomials
- Linear extension sums as valuations on cones
- scientific article; zbMATH DE number 1182900 (Why is no real title available?)
- Short rational generating functions for lattice point problems
- Random polynomials with prescribed Newton polytope
- An example of probability computations under the IAC assumption: the stability of scoring rules
- An algorithm to compute a nearest point in the lattice A_n^*
- Values of zeta functions at negative integers, Dedekind sums and toric geometry
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Eigenvalue distributions of reduced density matrices
- The \(q\)-analog of Kostant's partition function and the highest root of the simple Lie algebras
- Computing local zeta functions of groups, algebras, and modules
- Enumerating projections of integer points in unbounded polyhedra
- Continuum surface energy from a lattice model
- Cycles representing the Todd class of a toric variety
- Construction of some computational algorithms on finite sets of points in the plane
- From Gehrlein-Fishburn’s Method on Frequency Representation to a Direct Proof of Ehrhart’s extended Conjecture
- A plethora of polynomials: a toolbox for counting problems
- Short Presburger Arithmetic Is Hard
- Computing Optimized Path Integrals for Knapsack Feasibility
- The computational complexity of integer programming with alternations
- Graded Betti numbers of good filtrations
- Computing the Continuous Discretely
- Goldie rank of primitive quotients via lattice point enumeration.
- scientific article; zbMATH DE number 5222518 (Why is no real title available?)
- Computing the Ehrhart quasi-polynomial of a rational simplex
- The complexity of generating functions for integer points in polyhedra and beyond
- Computing algebraic numbers of bounded height
- Sparse Solutions of Linear Diophantine Equations
- Minimizing the number of lattice points in a translated polygon
- Polynomial values of surface point counting polynomials
- The corner poset with an application to an n-dimensional hypercube stacking puzzle
- Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
- On the Todd class of the permutohedral variety
- Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
- A method of deducing \(L\)-polyhedra for \(n\)-lattices
- Hopf monoids, permutohedral cones, and generalized retarded functions
- Asymptotic Euler-Maclaurin formula over lattice polytopes
- Enumeration and unimodular equivalence of empty delta-modular simplices
- Graded local cohomology of modules over semigroup rings
- Ramanujan type congruences for quotients of Klein forms
- Higher integrality conditions, volumes and Ehrhart polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938470)
