Related papers: Minimal knotted polygons in cubic lattices
We study the folding of the regular two-dimensional triangular lattice embedded in the regular three-dimensional Face Centered Cubic lattice, in the presence of quenched random spontaneous curvature. We consider two types of quenched…
We present a $O(n^{\frac{3}{2}})$-time algorithm for the \emph{shortest (diagonal) flip path problem} for \emph{lattice} triangulations with $n$ points, improving over previous $O(n^2)$-time algorithms. For a large, natural class of inputs,…
In order to model entanglements of polymers in a confined region, we consider the linking numbers and writhes of cycles in random linear embeddings of complete graphs in a cube. Our main results are that for a random linear embedding of…
The Embedded-Atom Model (EAM) provides a phenomenological description of atomic arrangements in metallic systems. It consists of a configurational energy depending on atomic positions and featuring the interplay of two-body atomic…
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,…
Lattice studies of spontaneous supersymmetry breaking suffer from a sign problem that in principle can be evaded through novel methods enabled by quantum computing. Focusing on lower-dimensional lattice systems with more modest resource…
It is often computationally advantageous to model space as a discrete set of points forming a lattice grid. This technique is particularly useful for computationally difficult problems such as quantum many-body systems. For reasons of…
The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…
Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing…
The existence of stable links and knots is demonstrated in three-dimensional, bistable, chemical media. The reaction-diffusion medium segregates into regions of high and low concentration separated by sharp interfaces. The interfaces repel…
We study the shortest vector lengths in module lattices over arbitrary number fields, with an emphasis on cyclotomic fields. In particular, we sharpen the techniques of arXiv:2308.15275v2 to establish improved results for the variance of…
The development of improved algorithms for QCD on the lattice has enabled us to do calculations at small quark masses and get control over the chiral extrapolation. Also finer lattices have become possible, however, a severe slowing down…
Low-dimensional embeddings are essential for machine learning tasks involving graphs, such as node classification, link prediction, community detection, network visualization, and network compression. Although recent studies have identified…
We analyse a family of lattices considered by Conway and Sloane and show that the corresponding Epstein zeta function attains a local minimum for the body-centred cubic lattice.
An effective indexing scheme for clusters that enables fast structure comparison and congruence check is desperately desirable in the field of mathematics, artificial intelligence, materials science, etc. Here we introduce the concept of…
We present a proposal for quantum information processing with neutral atoms trapped in optical lattices as qubits. Initialization and coherent control of single qubits can be achieved with standard laser cooling and spectroscopic…
In this lecture I give a brief review of low-dimensional few-body problems recently encountered in attempting a quantitative description of ultracold atoms and molecules confined in 2D and 1D optical lattices. Multi-channel nature of these…
Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the classical QR factorization of matrices, we compute efficient points for discrete multivariate least squares approximation and Lagrange…
We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…
A smooth path of rearrangement from the body-centered cubic (bcc) to the face-centered cubic (fcc) lattice is obtained by introducing a single parameter to cuboidal lattice vectors. As a result, we obtain analytical expressions in terms of…