Related papers: The densest lattice in twenty-four dimensions
In \cite{Sz17-2} we considered hyperball packings in $3$-dimensional hyperbolic space. We developed a decomposition algorithm that for each saturated hyperball packing provides a decomposition of $\HYP$ into truncated tetrahedra. In order…
We present the densest known packing of regular tetrahedra with density phi = 4000/4671 = 0.856347... Like the recently discovered packings of Kallus et al. [arXiv:0910.5226] and Torquato-Jiao [arXiv:0912.4210], our packing is crystalline…
We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions…
The dispersion of a point set in the unit square is defined to be the area of the largest empty axis-parallel box. In this paper we are interested in the dispersion of lattices in the plane, that is, the supremum of the area of the empty…
A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…
I present here another example of a lattice fibration, a discrete version of the highest dimensional Hopf fibration: $S^{7}\longrightarrow S^{15} \longrightarrow S^{8}$.
We prove the density hypothesis for congruence subgroups of an irreducible uniform lattice in $\mathrm{PSL}_2(\mathbb{R})^d$, extending previous results on the spherical density hypothesis to bound multiplicities of non-tempered…
We prove a number of results concerning the embedding of a Banach lattice $X$ into an r.i. space $Y$. For example we show that if $Y$ is an r.i. space on $[0,\infty)$ which is $p$-convex for some $p>2$ and has nontrivial concavity then any…
Dense polyhedron packings are useful models of a variety of condensed matter and biological systems and have intrigued scientists mathematicians for centuries. Recently, organizing principles for the types of structures associated with the…
We exhibit the densest sequence on the unit circle R/Z, x_k= log(2k-1)/log(2) (mod 1).
One of the challenging features of studying model Hamiltonians with cold atoms in optical lattices is the presence of spatial inhomogeneities induced by the confining potential, which results in the coexistence of different phases. This…
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…
Given a convex disk $K$ and a positive integer $k$, let $\delta_T^k(K)$ and $\delta_L^k(K)$ denote the $k$-fold translative packing density and the $k$-fold lattice packing density of $K$, respectively. Let $T$ be a triangle. In a very…
In this paper we study the convexity properties of geodesics and balls in Outer space equipped with the Lipschitz metric. We introduce a class of geodesics called balanced folding paths and show that, for every loop $\alpha$, the length of…
This paper introduces the chain lattice, a hierarchical truss structure comprising two interpenetrating lattices. One lattice toughens the material and prevents catastrophic localized failure while the other lattice serves as a porous…
In this paper, we show that there is a frame of norm k in the odd Leech lattice for every k\ge 3.
Maximum-density dimer packings (maximum matchings) of non-bipartite site-diluted lattices, such as the triangular and Shastry-Sutherland lattices in $d=2$ dimensions and the stacked-triangular and corner-sharing octahedral lattices in…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
In this paper we are concerned with three lattice problems: the lattice packing problem, the lattice covering problem and the lattice packing-covering problem. One way to find optimal lattices for these problems is to enumerate all finitely…
The article presents the mathematical sequences describing circle packing densities in four different geometric configurations involving a hexagonal lattice based equal circle packing in the Euclidian plane. The calculated sequences take…