相关论文: The hexagonal versus the square lattice
We prove that of all two-dimensional lattices of covolume 1 the hexagonal lattice has asymptotically the fewest distances. An analogous result for dimensions 3 to 8 was proved in 1991 by Conway and Sloane. Moreover, we give a survey of some…
Proving the universal optimality of the hexagonal lattice is one of the big open challenges of nowadays mathematics. We show that the hexagonal lattice outperforms certain "natural" classes of periodic configurations. Also, we rule out the…
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highest density circle packing among all lattices in $R^2$. With the benefit of hindsight, we show that the problem can be restricted to the…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
Consider the integer best approximations of a linear form in $n\ge 2$ real variables. While it is well-known that any tail of this sequence always spans a lattice is sharp for any $n\ge 2$. In this paper, we determine the exact Hausdorff…
We construct a unilateral lattice tiling of $\mathbb{R}^n$ into hypercubes of two differnet side lengths $p$ or $q$. This generalizes the Pythagorean tiling in $\mathbb{R}^2$. We also show that this tiling is unique up to symmetries, which…
In 2008, Schmidt and Tuller stated a conjecture concerning optimal packing and covering of integers by translates of a given three-point set. In this note, we confirm their conjecture and relate it to several other problems in…
In this short note, we prove that the degree-three dilation of the square lattice $\mathbb{Z}^2$ is $1+\sqrt{2}$. This disproves a conjecture of Dumitrescu and Ghosh. We give a computer-assisted proof of a local-global property for the…
With the help of the recently introduced parametric geometry of numbers by W. M. Schmidt and L. Summerer, we prove a strong version of a conjecture of Schmidt concerning the successive minima of a lattice.
A sublattice of the three-dimensional integer lattice $\mathbb Z^3$ is called cubic sublattice if there exists a basis of the sublattice whose elements are pairwise orthogonal and of equal lengths. We show that for an integer vector…
The Markov numbers are the positive integers that appear in the solutions of the equation $x^2+y^2+z^2=3xyz$. These numbers are a classical subject in number theory and have important ramifications in hyperbolic geometry, algebraic geometry…
1) We present new lattice sphere packings in Euclid spaces of many dimensions in the range 3332-4096, which are denser than known densest Mrodell-Weil lattice sphere packings in these dimensions. Moreover it is proved that if there were…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
An integral lattice which is generated by some vectors of norm $q$ is called $q$-lattice. Classification of 3-lattices of dimension at most four is given by Mimura (On 3-lattice, 2006). As a expansion, we give a classification of 3-lattices…
The "Mahler volume" is, intuitively speaking, a measure of how "round" a centrally symmetric convex body is. In one direction this intuition is given weight by a result of Santalo, who in the 1940s showed that the Mahler volume is…
It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher…
In a previous work [Scientific Reports 4, 6193(2014)] we proved the existence of scale symmetry in square and triangular (thus honeycomb) lattices by investigating the functiony=\arcsin(\sin(2\pinx)), where the parameter is either the…
A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…
We study random packings of $2\times2$ squares with centers on the square lattice $\mathbb{Z}^{2}$, in which the probability of a packing is proportional to $\lambda$ to the number of squares. We prove that for large $\lambda$, typical…
The integer convex hull $I(H_N)$ of the set $H_N=\{(x,y)\in \mathbb{R}^2: xy\ge N\}$ is the convex hull of the lattice points in $H_N$. The vertices of $I(H_N)$ lie in the square $[1,N]^2$. Improving on a recent result of Alc\'antara et al.…