Related papers: On Lattice Coverings by Simplices
We review results about the density of typical lattices in $R^n.$ They state that such density is of the order of $2^{-n}.$ We then obtain similar results for random packings in $R^n$: after taking suitably a fraction $\nu$ of a typical…
In this paper we give lower and upper bounds for the volume growth of a regular hyperbolic simplex, namely for the ratio of the $n$-dimensional volume of a regular simplex and the $(n-1)$-dimensional volume of its facets. In addition to the…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
We consider limits of certain measures supported on lattice points in lattice polyhedra defined as the intersection of half-spaces $\{m\in\mathbb{R}^n|\langle v_i,x\rangle+a_i \geq 0\}$, where $\sum_i v_i = 0$. The measures are densities…
It is shown that the diameter of a compact shrinking Ricci soliton has a universal lower bound. This is proved by extending universal estimates for the first non-zero eigenvalue of Laplacian on compact Riemannian manifolds with lower Ricci…
Spatial random permutations were originally studied due to their connections to Bose-Einstein condensation, but they possess many interesting properties of their own. For random permutations of a regular lattice with periodic boundary…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
The problem of the lattice diffusion of two particles coupled by a contact repulsive interaction is solved by finding analytical expressions of the two-body probability characteristic function. The interaction induces anomalous drift with a…
A concise review of the progress of lattice calculations at non-zero density since QM2006 is given, with emphasis on the high baryon density, low temperature domain. Possibilities for exploring densities higher than those studied by…
We study packings of hard spheres on lattices. The partition function, and therefore the pressure, may be written solely in terms of the accessible free volume, i.e. the volume of space that a sphere can explore without touching another…
We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice [Phys. Rev. E, \textbf{87} 052107 (2013)],…
By using elementary yet interesting observations and refining techniques used in a recent work by Fei Xue et al., we present new upper bounds for covering functionals of convex polytopes in $\mathbb{R}^n$ with few vertices. In these…
In this paper, we study the geometry of surfaces with the generalised simple lift property. This work generalises previous results by Bernstein and Tinaglia, and it is motivated by the fact that leaves of a minimal lamination obtained as a…
This paper investigates the geometry of compact contact manifolds that are uniformized by contact Lie groups, i.e., compact manifolds that are the quotient of some Lie group G with a left invariant contact structure and a uniform lattice…
We study translative arrangements of centrally symmetric convex domains in the plane (resp., of congruent balls in the Euclidean $3$-space) that neither pack nor cover. We define their soft density depending on a soft parameter and prove…
Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…
In this paper, we use the hardness of quantization over general lattices as the basis of developing a physical layer secrecy system. Assuming that the channel state observed by the legitimate receiver and the eavesdropper are distinct, this…
After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…
We use a recently developed lattice model to study the percolation of particles of different sizes and shapes in the presence of a polymer matrix. The polymer is modeled as an infinitely long semiflexible chain. We study the effects of the…