On the number of integer points in translated and expanded polyhedra

DOI10.1007/S00454-020-00178-ZMaRDI QIDQ2227240zbMATH OpenOpenAlexFDO

Authors Danny Nguyen, Igor Pak

Publication date 10 February 2021

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.03685

zbMATH Keywords

optimizationpolytopestranslationEhrhart quasi-polynomialscounting integer points

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Minimizing the number of lattice points in a translated polygon
• On integer points in polyhedra
• Computing the period of an Ehrhart quasi-polynomial
• On integer points in polyhedra: A lower bound
• Generalized Ehrhart polynomials

Cites work

• scientific article; zbMATH DE number 4204116 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2066386 (Why is no real title available?)
• scientific article; zbMATH DE number 1405493 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• Bounds on generalized Frobenius numbers
• Complexity of short generating functions
• Complexity of the Frobenius problem
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• Computational Complexity
• Computing the Ehrhart quasi-polynomial of a rational simplex
• Computing the period of an Ehrhart quasi-polynomial
• Counting with rational generating functions
• Faster algorithms for Frobenius numbers
• Integer Polynomial Optimization in Fixed Dimension
• Integer Programming with a Fixed Number of Variables
• Integer points in knapsack polytopes and \(s\)-covering radius
• Integer points in polyhedra
• Lattice translates of a polytope and the Frobenius problem
• Maximal periods of (Ehrhart) quasi-polynomials
• Minimizing the number of lattice points in a translated polygon
• NP-complete decision problems for binary quadratics
• Parametric integer programming in fixed dimension
• Parametric polyhedra with at least \(k\) lattice points: their semigroup structure and the \(k\)-Frobenius problem
• Periods of Ehrhart coefficients of rational polytopes
• Short rational generating functions for lattice point problems
• The complexity of generating functions for integer points in polyhedra and beyond
• The computational complexity of integer programming with alternations
• Unimodality problems in Ehrhart theory

Cited in

(3)

• The generalized Frobenius problem via restricted partition functions
• On the number of integer points in translated and expanded polyhedra
• Quasi-period collapse and GL_n(Z)-scissors congruence in rational polytopes

This page was built for publication: On the number of integer points in translated and expanded polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227240)