Related papers: Locked and Unlocked Chains of Planar Shapes
This review presents recent progress in understanding constraints and consequences of close-packing geometry of filamentous or columnar materials possessing non-trivial textures, focusing in particular on the common motifs of twisted and…
We construct several families of embeddings of braid groups into mapping class groups of orientable and non-orientable surfaces and prove that they induce the trivial map in stable homology in the orientable case, but not so in the…
A $3$-Prismatoid is the convex hull of two convex polygons $A$ and $B$ which lie in parallel planes $H_A, H_B\subset\mathbb{R}^3$. Let $A'$ be the orthogonal projection of $A$ onto $H_B$. A prismatoid is called nested if $A'$ is properly…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
In this paper we analyze symmetries, hidden symmetries, and commensurability classes of $(\epsilon, d_L)$-twisted knot complements, which are the complements of knots that have a sufficiently large number of twists in each of their twist…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
Can active forces be exploited to drive the consistent collapse of an active polymer into a folded structure? In this paper we introduce and perform numerical simulations of a simple model of active colloidal folders, and show that a…
Experimentally observed complex networks are often scale-free, small-world and have unexpectedly large number of small cycles. Apollonian network is one notable example of a model network respecting simultaneously having all three of these…
The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…
The art and science of folding intricate three-dimensional structures out of paper has occupied artists, designers, engineers, and mathematicians for decades, culminating in the design of deployable structures and mechanical metamaterials.…
We investigate when a Legendrian knot in standard contact $\mathbb{R}^3$ has a non-orientable exact Lagrangian filling. We prove analogs of several results in the orientable setting, develop new combinatorial obstructions to fillability,…
Following the approach outlined in [18], convergence to SLE6 of the Exploration Processes for the correlated bond-triangular type models studied in [7] is established. This puts the said models in the same universality class as the standard…
Starting with the unsolved "D\"urer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which…
It is shown that if a link in 3-space bounds a proper oriented surface (without closed component) in the upper half 4-space, then the link bounds a proper oriented ribbon surface in the upper half 4-space which is a renewal embedding of the…
Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some…
We consider sufficient conditions which guarantee that a planar embedding has a unique fixed point. We study sufficient conditions which imply the appearing of a globally attracting fixed point for such an embedding.
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…