Related papers: The Optimal Isodual Lattice Quantizer in Three Dim…
Motivated by the search for best lattice sphere packings in Euclidean spaces of large dimensions we study randomly generated perfect lattices in moderately large dimensions (up to d=19 included). Perfect lattices are relevant in the…
A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…
A (positive definite and integral) quadratic form is called {\it an isolation} of a quadratic form $f$ if it represents all subforms of $f$ except for $f$ itself. The minimum rank of isolations of a quadratic form $f$ is denoted, if it…
This paper treats certain integral lattices with respect to ternary quadratic forms, which are obtained from the data of a non-zero element and a maximal lattice in a quaternary quadratic space. Such a lattice can be described by means of…
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…
The aim of this paper is to study lattice-like coverings with congruent translation balls and the packings and coverings with a type of translation cylinders in Sol space related to the fundamental lattices. We introduce the notions of the…
We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at or near critical external fields. The incipient infinite cluster (IIC) measure in the sense of Kesten is constructed. As a…
Let $m$ be a positive integer and $\mathcal{C}$ be a collection of closed subspaces in $L^2(\mathbb{R})$. Given the measurements $\mathcal{F}_Y=\left\lbrace \left\lbrace y_k^1 \right\rbrace_{k\in \mathbb{Z}},\ldots, \left\lbrace y_k^m…
Cubic interactions are considered in 3 and 7 space dimensions, respectively, for bosonic membranes in Poisson Bracket form. Their symmetries and vacuum configurations are discussed. Their associated first order equations are transformed to…
In the Metric Capacitated Covering (MCC) problem, given a set of balls $\mathcal{B}$ in a metric space $P$ with metric $d$ and a capacity parameter $U$, the goal is to find a minimum sized subset $\mathcal{B}'\subseteq \mathcal{B}$ and an…
We show that if $X$ is a uniformly perfect complete metric space satisfying the finite doubling property, then there exists a fully supported measure with lower regularity dimension as close to the lower dimension of $X$ as we wish.…
The coincidence site lattices (CSLs) of prominent 4-dimensional lattices are considered. CSLs in 3 dimensions have been used for decades to describe grain boundaries in crystals. Quasicrystals suggest to also look at CSLs in dimensions…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In…
We propose a new method to construct maximin distance designs with arbitrary number of dimensions and points. The proposed designs hold interleaved-layer structures and are by far the best maximin distance designs in four or more…
Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice…
Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…