Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
نویسندگان
چکیده
منابع مشابه
Universal Counting of Lattice Points in Polytopes
Given a lattice polytope P (with underlying lattice L), the universal counting function UP (L ) = |P ∩ L| is defined on all lattices L containing L. Motivated by questions concerning lattice polytopes and the Ehrhart polynomial, we study the equation UP = UQ. Mathematics Subject Classification: 52B20, 52A27, 11P21 Partially supported by Hungarian Science Foundation Grant T 016391, and by the Fr...
متن کاملCounting Rational Points on Hypersurfaces
For any n ≥ 2, let F ∈ Z[x1, . . . , xn] be a form of degree d ≥ 2, which produces a geometrically irreducible hypersurface in P. This paper is concerned with the number N(F ; B) of rational points on F = 0 which have height at most B. For any ε > 0 we establish the estimate N(F ; B) = O(B), whenever either n ≤ 5 or the hypersurface is not a union of lines. Here the implied constant depends at ...
متن کاملMinimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
This paper is about theminimization of Lipschitz-continuous and strongly convex functions over integer points in polytopes. Our results are related to the rate of convergence of a black-box algorithm that iteratively solves special quadratic integer problems with a constant approximation factor. Despite the generality of the underlying problem, we prove that we can find efficiently, with respec...
متن کاملInteger Points in Knapsack Polytopes and s-Covering Radius
Given a matrix A ∈ Zm×n satisfying certain regularity assumptions, we consider for a positive integer s the set Fs(A) ⊂ Zm of all vectors b ∈ Zm such that the associated knapsack polytope P (A, b) = {x ∈ R>0 : Ax = b} contains at least s integer points. We present lower and upper bounds on the so called diagonal s-Frobenius number associated to the set Fs(A). In the case m = 1 we prove an optim...
متن کاملCounting with rational generating functions
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-006-1231-0