scientific article; zbMATH DE number 1405493
From MaRDI portal
zbMATH Open0940.05004MaRDI QIDQ4938470FDOQ4938470
Authors: Alexander Barvinok, James Pommersheim 
Publication date: 19 July 2000
Full work available at URL: http://www.msri.org/communications/books/Book38/
Title of this publication is not available (Why is that?)
Recommendations
latticesurveygenerating functionpolyhedratoric varietiesvaluationsalgorithmic complexityinteger points
Exact enumeration problems, generating functions (05A15) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Cited In (only showing first 100 items - show all)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Computing the Ehrhart quasi-polynomial of a rational simplex
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- Berline-Vergne valuation and generalized permutohedra
- On the enumeration of certain weighted graphs
- Effective lattice point counting in rational convex polytopes
- The unreasonable ubiquitousness of quasi-polynomials
- MacMahon’s Dream
- Computing algebraic numbers of bounded height
- The meaning of Ramanujan now and for the future
- Sparsity in sums of squares of polynomials
- Title not available (Why is that?)
- The complexity of generating functions for integer points in polyhedra and beyond
- A quantitative Doignon-Bell-Scarf theorem
- The unexpected behavior of plurality rule
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Steinhaus' lattice point problem for polyhedra
- Faster geometric algorithms via dynamic determinant computation
- The Jones slopes of a knot
- Sum-integral interpolators and the Euler-Maclaurin formula for polytopes
- Implicitization of curves and (hyper)surfaces using predicted support
- Linear extension sums as valuations on cones
- On the complexity of computing Kronecker coefficients
- Computing local zeta functions of groups, algebras, and modules
- Values of zeta functions at negative integers, Dedekind sums and toric geometry
- Nearest lattice point algorithms on semi \(k\)-reduced basis
- Correlation, partitioning and the probability of casting a decisive vote under the majority rule
- Enumerating a subset of the integer points inside a Minkowski sum
- Computing the integer programming gap
- Distances to lattice points in knapsack polyhedra
- Enumerating projections of integer points in unbounded polyhedra
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- An example of probability computations under the IAC assumption: the stability of scoring rules
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- Cycles representing the Todd class of a toric variety
- On the GLY conjecture of upper estimate of positive integral points in real right-angled simplices
- Eigenvalue distributions of reduced density matrices
- Asymptotic Euler-Maclaurin formula over lattice polytopes
- Generating functions and duality for integer programs
- An algebraic-perturbation variant of Barvinok's algorithm
- An algorithm reconstructing convex lattice sets.
- Integer points in polyhedra
- On lattice point counting in \(\varDelta\)-modular polyhedra
- The many aspects of counting lattice points in polytopes
- Euler-Maclaurin with remainder for a simple integral polytope
- A computational study of integer programming algorithms based on Barvinok's rational functions
- On Ehrhart polynomials and probability calculations in voting theory
- Counting with rational generating functions
- Model checking the evolution of gene regulatory networks
- Continuum surface energy from a lattice model
- Complexity of short generating functions
- Higher integrality conditions, volumes and Ehrhart polynomials
- Computing the Continuous Discretely
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Short rational functions for toric algebra and applications
- A generalization of the integer linear infeasibility problem
- Spectral invariants, analysis of the Floer moduli space, and geometry of the Hamiltonian diffeomorphism group
- Bias expansion of spatial statistics and approximation of differenced lattice point counts
- Short rational generating functions for lattice point problems
- Algorithms for the frame of a finitely generated unbounded polyhedron
- Random polynomials with prescribed Newton polytope
- Title not available (Why is that?)
- Evaluation of Dedekind sums, Eisenstein cocycles, and special values of \(L\)-functions
- La valeur optimale des programmes entiers. (The optimal value of integer programs)
- Computing weight \(q\)-multiplicities for the representations of the simple Lie algebras
- Difference dimension quasi-polynomials
- Exact Euler-Maclaurin formulas for simple lattice polytopes
- Ehrhart polynomials of matroid polytopes and polymatroids
- The \(q\)-analog of Kostant's partition function and the highest root of the simple Lie algebras
- Ehrhart series and lattice triangulations
- On a valuation of rational subsets of \(Z^{k}\)
- Computing points of bounded height in projective space over a number field
- Solving the knapsack problem via \(\mathbb Z\)-transform
- Computing Optimized Path Integrals for Knapsack Feasibility
- The computational complexity of integer programming with alternations
- Sparse representation of vectors in lattices and semigroups
- On the number of integer points in translated and expanded polyhedra
- Construction of some computational algorithms on finite sets of points in the plane
- Generalized permutohedra in the kinematic space
- A discrete Farkas lemma
- A plethora of polynomials: a toolbox for counting problems
- On the Todd class of the permutohedral variety
- Enumeration of integer points in projections of unbounded polyhedra
- A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Goldie rank of primitive quotients via lattice point enumeration.
- Hopf monoids, permutohedral cones, and generalized retarded functions
- The corner poset with an application to an \(n\)-dimensional hypercube stacking puzzle
- Graded local cohomology of modules over semigroup rings
- Ramanujan type congruences for quotients of Klein forms
- Eisenstein cocycles in motivic cohomology
- Majority properties of positional social preference correspondences
- Counting chemical compositions using Ehrhart quasi-polynomials
- A rainbow Ramsey analogue of Rado's theorem
- Short rational generating functions for solving some families of fuzzy integer programming problems
- A method of deducing \(L\)-polyhedra for \(n\)-lattices
- On approximation algorithms for concave mixed-integer quadratic programming
- Title not available (Why is that?)
- From Gehrlein-Fishburn’s Method on Frequency Representation to a Direct Proof of Ehrhart’s extended Conjecture
- Short Presburger Arithmetic Is Hard
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)
