相关论文: Densest Lattice Packings of 3-Polytopes

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…

Four packings of hyperbolic 3-space are known to yield the optimal packing density of $0.85328\dots$. They are realized in the regular tetrahedral and cubic Coxeter honeycombs with Schl\"afli symbols $\{3,3,6 \}$ and $\{4,3,6\}$. These…

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…

We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…

Let $\omega=(-1+\sqrt{-3})/2$. For any lattice $P\subseteq \mathbb{Z}^n$, $\mathcal{P}=P+\omega P$ is a subgroup of $\mathcal{O}_K^n$, where $\mathcal{O}_K=\mathbb{Z}[\omega]\subseteq \mathbb{C}$. As $\mathbb{C}$ is naturally isomorphic to…

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…

We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

Recently, Venkatesh improved the best known lower bound for lattice sphere packings by a factor $\log\log n$ for infinitely many dimensions $n$. Here we prove an effective version of this result, in the sense that we exhibit, for the same…

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

We study the entropy of a set of identical hard objects, of general shape, with each object pivoted on the vertices of a d-dimensional regular lattice of lattice spacing a, but can have arbitrary orientations. When the pivoting point is…

We consider the problem of wrapping three-dimensional solid bodies with a given planar sheet of paper, where the paper may be folded or wrinkled but not stretched or torn. We propose a conjecture characterising the maximumvolume solid…

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…

The extraction of inhomogeneous 3-dimensional densities around tagged solutes from molecular simulations is known to have a very high computational cost because this is traditionally performed by collecting histograms, with each discrete…

We introduce a new method from number fields and codes to construct dense packings in the Euclidean spaces. Via the canonical $\mathbb{Q}$-embedding of arbitrary number field $K$ into $\mathbb{R}^{[K:\mathbb{Q}]}$, both the prime ideal…

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…