On the number of integer points in translated and expanded polyhedra

DOI10.1007/S00454-020-00178-ZOpenAlexW3005326639MaRDI QIDQ2227240FDOQ2227240

Igor Pak, Danny Nguyen

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

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

zbMATH Keywords

optimizationpolytopestranslationEhrhart quasi-polynomialscounting integer points

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Unimodality problems in Ehrhart theory
• Title not available (Why is that?)
• Computational Complexity
• Integer Programming with a Fixed Number of Variables
• NP-complete decision problems for binary quadratics
• Parametric Integer Programming in Fixed Dimension
• Title not available (Why is that?)
• Title not available (Why is that?)
• COMPLEXITY OF SHORT GENERATING FUNCTIONS
• Integer Polynomial Optimization in Fixed Dimension
• Integer points in polyhedra
• Lattice translates of a polytope and the Frobenius problem
• Complexity of the Frobenius problem
• Short rational generating functions for lattice point problems
• The complexity of generating functions for integer points in polyhedra and beyond
• Faster algorithms for Frobenius numbers
• Counting with rational generating functions
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• Title not available (Why is that?)
• Computing the Ehrhart quasi-polynomial of a rational simplex
• Bounds on generalized Frobenius numbers
• Maximal periods of (Ehrhart) quasi-polynomials
• Computing the period of an Ehrhart quasi-polynomial
• Title not available (Why is that?)
• Periods of Ehrhart coefficients of rational polytopes
• Parametric polyhedra with at least k lattice points: Their semigroup structure and the k-Frobenius problem
• Integer points in knapsack polytopes and \(s\)-covering radius
• The computational complexity of integer programming with alternations
• Minimizing the number of lattice points in a translated polygon

Cited In (3)

• On the number of integer points in translated and expanded polyhedra
• The generalized Frobenius problem via restricted partition functions
• 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)