相关论文: On packing of Minkowski balls. I

We introduce a parameter space for periodic point sets, given as unions of $m$ translates of point lattices. In it we investigate the behavior of the sphere packing density function and derive sufficient conditions for local optimality.…

We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond…

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…

We prove that the group of compactly supported symplectomorphisms of the standard symplectic ball admits a continuum of linearly independent real-valued homogeneous quasimorphisms. In addition these quasimorphisms are Lipschitz in the Hofer…

As a prelude to what might be expected as forthcoming breakthroughs in finding new approaches toward solving three-dimensional lattice models in the twenty-first century, we review the exact solutions of two lattice models in three…

We study optimal transportation of measures on compact manifolds for costs defined from convex Lagrangians. We prove that optimal transportation can be interpolated by measured Lipschitz laminations, or geometric currents. The methods are…

Building on the earlier work of Odeh, Barany, Golubitsky, Turski and Lasher we give a proof of existence of Abrikosov vortex lattices in the Ginzburg-Landau model of superconductivity.

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…

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

We show that the number of lattice directions in which a d-dimensional convex body in R^d has minimum width is at most 3^d-1, with equality only for the regular cross-polytope. This is deduced from a sharpened version of the 3^d-theorem due…

This paper concerns the minimax center of a collection of linear subspaces. When the subspaces are $k$-dimensional subspaces of $\mathbb{R}^n$, this can be cast as finding the center of a minimum enclosing ball on a Grassmann manifold,…

It is shown that, given any $k$-dimensional lattice $\Lambda$, there is a lattice sequence $\Lambda_w$, $w\in \mathbb Z$, with sub-orthogonal lattice $\Lambda_o \subset \Lambda$, converging to $\Lambda$ (unless equivalence), also we discuss…

Assuming the Gowers Inverse conjecture and the M\"{o}bius conjecture for the finite parameter $s$, Green-Tao verified Dickson's conjecture for lattices which are ranges of linear maps of complexity at most $s$. In this paper, we reformulate…

For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…

We show that the congruence lattice of a semilattice satsifies a form of distributivity relative to principal congruences of the form $ \Theta_{t \odot s, s}$. Particularly, we establish that semilattice congruences obey the ``pairwise…

In this research announcement we outline the methods used in our recent proof that the Leech lattice is the unique densest lattice in R^24. Complete details will appear elsewhere, but here we illustrate our techniques by applying them to…

One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…