Related papers: Towards Strong Reverse Minkowski-type Inequalities…
We report on an exact calculation of lattice correlation functions on a finite four-dimensional lattice with either Euclidean or Minkowskian signature. The lattice correlation functions are calculated by the method of differential…
We develop a reverse entropy power inequality for convex measures, which may be seen as an affine-geometric inverse of the entropy power inequality of Shannon and Stam. The specialization of this inequality to log-concave measures may be…
In this paper we prove the Kneser-Poulsen conjecture for the case of large radii. Namely, if a finite number of points in Euclidean space $E^n$ is rearranged so that the distance between each pair of points does not decrease, then there…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
In this paper we prove an analogue of Mordell's inequality for lattices in finite-dimensional complex or quaternionic Hermitian space that are modules over a maximal order in an imaginary quadratic number field or a totally definite…
In a seminal paper "Volumen und Oberfl\"ache" (1903), Minkowski introduced the basic notion of mixed volumes and the corresponding inequalities that lie at the heart of convex geometry. The fundamental importance of characterizing the…
We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…
A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…
Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…
Motivated by long-standing conjectures on the discretization of classical inequalities in the Geometry of Numbers, we investigate a new set of parameters, which we call \emph{packing minima}, associated to a convex body $K$ and a lattice…
The Bourque-Ligh conjecture states that if $S=\{x_1,x_2,\ldots,x_n\}$ is a gcd-closed set of positive integers with distinct elements, then the LCM matrix $[S]=[\hbox{lcm}(x_i,x_j)]$ is invertible. It is well known that this conjecture…
This paper proves that for every convex body in R^n there exist 5n-4 Minkowski symmetrizations, which transform the body into an approximate Euclidean ball. This result complements the sharp c n log n upper estimate by J. Bourgain, J.…
We study the statistical properties of the counting function of lattice points inside thin annuli. By a conjecture of Bleher and Lebowitz, if the width shrinks to zero, but the area converges to infinity, the distribution converges to the…
It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
The classical Brunn-Minkowski inequality states that for $A_1,A_2\subset\R^n$ compact, $$ |A_1+A_2|^{1/n}\ge |A_1|^{1/n}+|A_2|^{1/n}\eqno(1) $$ where $|\cdot|$ denotes the Lebesgue measure on $\R^n$. In 1986 V. Milman {\bf [Mil 1]}…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…
We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of $(R\cup\{-\infty\})^n$ can be written as the max-plus convex combination of at most $n+1$ of the extreme points of this…