Related papers: Local minimality of the truncated octahedron for t…
We perturb the SC, BCC, and FCC crystal structures with a spatial Gaussian noise whose adimensional strength is controlled by the parameter a, and analyze the topological and metrical properties of the resulting Voronoi Tessellations (VT).…
We study the local optimality of Simple Cubic, Body-Centred-Cubic and Face-Centred-Cubic lattices among Bravais lattices of fixed density for some finite energy per point. Following the work of Ennola [Math. Proc. Cambridge, 60:855--875,…
In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…
The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…
An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writhe of minimal length knotted polygons in each of the…
We investigate the local and global optimality of the triangular, square, simple cubic, face-centred-cubic (FCC), body-centred-cubic (BCC) lattices and the hexagonal-close-packing (HCP) structure for a potential energy per point generated…
A $\lambda$-convex body in a three-dimensional space form $M^3(c)$ of constant curvature $c$ is a compact convex set $K$ whose boundary $\partial K$ has normal curvatures bounded below by a constant $\lambda>0$ (in a weak sense). Within…
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…
We discuss the local minimality of certain configurations for a nonlocal isoperimetric problem used to model microphase separation in diblock copolymer melts. We show that critical configurations with positive second variation are local…
We consider pairwise interaction energies and we investigate their minimizers among lattices with prescribed minimal vectors (length and coordination number), i.e. the one corresponding to the crystal's bonds. In particular, we show the…
In this note we give a polynomial time algorithm for solving the closest vector problem in the class of zonotopal lattices. The Voronoi cell of a zonotopal lattice is a zonotope, i.e. a projection of a regular cube. Examples of zonotopal…
We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geometry of Voronoi cells of lattices in any dimension is similar…
In this paper we solve several reverse isoperimetric problems in the class of $\lambda$-convex bodies, i.e., convex bodies whose curvature at each point of their boundary is bounded below by some $\lambda > 0$. We give an affirmative answer…
The Riesz potential $f_s(r)=r^{-s}$ is known to be an important building block of many interactions, including Lennard-Jones type potentials $f_{n,m}^{\rm{LJ}}(r):=a r^{-n}-b r^{-m}$, $n>m$ that are widely used in Molecular Simulations. In…
In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is shown that the intersection of a suitable ball with the…
In this paper, we investigate the minimization of a functional in which the usual perimeter is competing with a nonlocal singular term comparable (but not necessarily equal to) a fractional perimeter. The motivation for this problem is a…
In this article, we solve the relative isoperimetric problem in $[0,1]^3$ for orthogonal polyhedra. Up to isometries of the cube or sets of measure $0$, the minimizers are of the form $[0,\epsilon]^3$, $[0,\epsilon]^2 \times [0,1]$, or…
We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…
We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…
In this paper the elementary moves of the BFACF-algorithm for lattice polygons are generalised to elementary moves of BFACF-style algorithms for lattice polygons in the body-centred (BCC) and face-centred (FCC) cubic lattices. We prove that…