相关论文: Optimal shapes of compact strings
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…
Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…
The protein folding problem must ultimately be solved on all length scales from the atomic up through a hierarchy of complicated structures. By analyzing the stability of the folding process using physics and mathematics, this paper shows…
Static packings of perfectly rigid particles are investigated theoretically and numerically. The problem of finding the contact forces in such packings is formulated mathematically. Letting the values of the contact forces define a vector…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…
Proteins are linear chain molecules that play a central role in life and health. Protein native state folds are modular assemblies of space-filling building blocks of {\alpha}-helices, \{beta}-sheets and tight turns. Here we deduce the…
Mathematical crystal chemistry views crystal structures as the optimal solutions of mathematical optimization problem formalizing inorganic structural chemistry. This paper introduces the minimum and maximum atomic radii depending on the…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
We consider the problem of establishing dense correspondences within a set of related shapes of strongly varying geometry. For such input, traditional shape matching approaches often produce unsatisfactory results. We propose an ensemble…
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…
Proteins form a very important class of polymers. In spite of major advances in the understanding of polymer science, the protein problem has remained largely unsolved. Here, we show that a polymer chain viewed as a tube not only captures…
Random packings of objects of a particular shape are ubiquitous in science and engineering. However, such jammed matter states have eluded any systematic theoretical treatment due to the strong positional and orientational correlations…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$, $(x,0)$, and $(0,y)$ and fixed area, which one encloses the most lattice points from $\mathbb{Z}_{>0}^2$?…