Integer Knapsacks: Average Behavior of the Frobenius Numbers
The main result of the paper shows that the asymptotic growth of the Frobenius number in average is significantly slower than the growth of the maximum Frobenius number.
math.NT↗
arXiv subjects
Martin Henk
Publications and source records attributed to Martin Henk.
Three-dimensional polyhedra can be described by three polynomial inequalities
Bosse et al. conjectured that for every natural number $d \ge 2$ and every $d$-dimensional polytope $P$ in $\real^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying $P=\{x \in \mathbb{R}^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}.$ We show that for dimensions $d \le 3$ even every $d$-dimensional polyhedron can be described by $d$ polynomial inequalities. The proof of our result is constructive.
math.MG↗
Lower bounds on the coefficients of Ehrhart polynomials
We present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of their volume. Concerning the coefficients of the Ehrhart series of a lattice polytope we show that Hibi's lower bound is not true for lattice polytopes without interior lattice points. The counterexample is based on a formula of the Ehrhart series of the join of two lattice polytope. We also present a formula for calculating the Ehrhart series of integral dilates of a polytope.
math.MG↗
Representing simple d-dimensional polytopes by d polynomials
A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of polynomials in a polynomial representation of P. It is known that d \le s(d,P) \le 2d-1. Moreover, it is conjectured that s(d,P)=d for all convex d-polytopes P. We confirm this conjecture for simple d-polytopes by providing an explicit construction of d polynomials that represent a given simple d-polytope P.
math.MG↗
A Blichfeldt-type inequality for the surface area
In 1921 Blichfeldt gave an upper bound on the number of integral points contained in a convex body in terms of the volume of the body. More precisely, he showed that $#(K\cap\Z^n)\leq n! \vol(K)+n$, whenever $K\subset\R^n$ is a convex body containing $n+1$ affinely independent integral points. Here we prove an analogous inequality with respect to the surface area $\F(K)$, namely $ #(K\cap\Z^n) < \vol(K) + ((\sqrt{n}+1)/2) (n-1)! \F(K)$. The proof is based on a slight improvement of Blichfeldt's bound in the case when $K$ is a non-lattice translate of a lattice polytope, i.e., $K=t+P$, where $t\in\R^n\setminus\Z^n$ and $P$ is an $n$-dimensional polytope with integral vertices. Then we have $#((t+P)\cap\Z^n)\leq n! \vol(P)$. Moreover, in the 3-dimensional case we prove a stronger inequality, namely $#(K\cap\Z^n) < \vol(K) + 2 \F(K)$.
math.MG↗
Notes on the roots of Steiner polynomials
We study the location and the size of the roots of Steiner polynomials of convex bodies in the Minkowski relative geometry. Based on a problem of Teissier on the intersection numbers of Cartier divisors of compact algebraic varieties it was conjectured that these roots have certain geometric properties related to the in- and circumradius of the convex body. We show that the roots of 1-tangential bodies fulfill the conjecture, but we also present convex bodies violating each of the conjectured properties.
math.MG↗
Notes on the roots of Ehrhart polynomials
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n^2, where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun where it is shown that the norm of a root of an Ehrhart polynomial is at most of order n^2. For the class of 0-symmetric lattice polytopes we present a conjecture on the smallest volume for a given number of interior lattice points and prove the conjecture for crosspolytopes. We further give a characterisation of the roots of the Ehrhart polyomials in the 3-dimensional case and we classify for n\leq 4 all lattice polytopes whose roots of their Ehrhart polynomials have all real part -1/2. These polytopes belong to the class of reflexive polytopes.
math.MG↗
Ehrhart polynomial and Successive Minima
We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related by their geometric and arithmetic mean. We also show that the roots of lattice $n$-polytopes with or without interior lattice points differ essentially. Furthermore, we study the structure of the roots in the planar case. Here it turns out that their distribution reflects basic properties of lattice polygons.
math.MG↗
Successive Minima and Best Simultaneous Diophantine Approximations
We study the problem of best approximations of a vector $α\in{\mathbb R}^n$ by rational vectors of a lattice $Λ\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic lattice structure and extend some classical results from geometry of numbers to this structure. This leads to bounds for the best approximation problem which generalize and improve former results.
math.NT↗
Free planes in lattice sphere packings
We show that for every lattice packing of $n$-dimensional spheres there exists an $(n/\log_2(n))$-dimensional affine plane which does not meet any of the spheres in their interior, provided $n$ is large enough. Such an affine plane is called a free plane and our result improves on former bounds.
math.MG↗
Polynomial inequalities representing polyhedra
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound 2n-2 and for arbitrary polyhedra we get a constructible representation by 2n polynomial inequalities.
math.MG↗
On the representation of polyhedra by polynomial inequalities
A beautiful result of Bröcker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most $d(d+1)/2$ polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any bound depending only on the dimension. Here we give, for simple polytopes, an explicit construction of polynomials describing such a polytope. The number of used polynomials is exponential in the dimension, but in the 2- and 3-dimensional case we get the expected number $d(d+1)/2$.
math.MG↗
On the Equations Defining Toric L.C.I. Singularities
Based on Nakajima's Classification Theorem we describe the precise form of the binomial equations which determine toric locally complete intersection ("l.c.i'') singularities.
math.AG↗
Successive Minima and Lattice Points
The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a lattice point analogue of Minkowski's second theorem on successive minima. Minkowski's proof of his second theorem is rather lengthy and it was also criticised as obscure. We present a short proof of Minkowski's second theorem on successive minima, which, however, is based on the ideas of Minkowski's proof.
math.MG↗
Densest Lattice Packings of 3-Polytopes
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
math.MG↗
On a series of Gorenstein cyclic quotient singularities admitting a unique projective crepant resolution
In this paper we prove that the Gorenstein cyclic quotient singularities of type \frac 1l (1,..., 1,l-(r-1)) with $l\geq r\geq 2$, have a \textit{unique}torus-equivariant projective, crepant, partial resolution, which is ``full'' iff either $l\equiv 0$ mod $% (r-1) $ or $l\equiv 1$ mod $(r-1) $. As it turns out, if one of these two conditions is fulfilled, then the exceptional locus of the full desingularization consists of $\lfloor \frac{l}{r-1} \rfloor$ prime divisors, $\lfloor \frac{l}{r-1}\rfloor - 1$ of which are isomorphic to the total spaces of $\Bbb{P}_{\Bbb{C}}^1$-bundles over $\Bbb{P}_{\Bbb{C}%}^{r-2}$. Moreover, it is shown that intersection numbers are computable explicitly and that the resolution morphism can be viewed as a composite of successive (normalized) blow-ups. Obviously, the monoparametrized singularity-series of the above type contains (as its ``first member'') the well-known Gorenstein singularity defined by the origin of the affine cone which lies over the $r$-tuple Veronese embedding of $\Bbb{P}_{\Bbb{C}}^{r-1}$.
math.AG↗
On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities
An immediate generalization of the classical McKay correspondence for Gorenstein quotient spaces $\Bbb{C}^{r}/G$ in dimensions $r\geq 4$ would primarily demand the existence of projective, crepant, full desingularizations. Since this is not always possible, it is natural to ask about special classes of such quotient spaces which would satisfy the above property. In this paper we give explicit necessary and sufficient conditions under which 2-parameter series of Gorenstein cyclic quotient singularities have torus-equivariant resolutions of this specific sort in all dimensions.
math.AG↗
All Abelian Quotient C.I.-Singularities Admit Projective Crepant Resolutions in All Dimensions
For Gorenstein quotient spaces $C^d/G$, a direct generalization of the classical McKay correspondence in dimensions $d\geq 4$ would primarily demand the existence of projective, crepant desingularizations. Since this turned out to be not always possible, Reid asked about special classes of such quotient spaces which would satisfy the above property. We prove that the underlying spaces of all Gorenstein abelian quotient singularities, which are embeddable as complete intersections of hypersurfaces in an affine space, have torus-equivariant projective crepant resolutions in all dimensions. We use techniques from toric and discrete geometry.
alg-geom↗