English
Related papers

Related papers: Locked and Unlocked Chains of Planar Shapes

200 papers

We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…

Computational Geometry · Computer Science 2021-05-25 Zachary Abel , Erik D. Demaine , Martin L. Demaine , Jason S. Ku , Jayson Lynch , Jin-ichi Itoh , Chie Nara

For each connected alternating tangle, we provide an infinite family of non-left-orderable L-spaces. This gives further support for Conjecture [3] of Boyer, Gordon, and Watson that is a rational homology 3-sphere is an L-space if and only…

Geometric Topology · Mathematics 2021-11-29 Hamid Abchir , Mohammed Sabak

We study spherical completeness of ball spaces and its stability under expansions. We give some criteria for ball spaces that guarantee that spherical completeness is preserved when the ball space is closed under unions of chains. This…

Logic · Mathematics 2024-04-05 Wiesław Kubiś , Franz-Viktor Kuhlmann

In this paper, we focus on contact structures supported by planar open book decompositions. We study right-veering diffeomorphisms to keep track of overtwistedness property of contact structures under some monodromy changes. As an…

Geometric Topology · Mathematics 2018-03-23 M. Firat Arikan , Selahi Durusoy

The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.

Computational Geometry · Computer Science 2007-05-23 Joseph O'Rourke

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

This paper studies the configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line. The main results are that,…

Computational Geometry · Computer Science 2008-11-11 Don Shimamoto , Mary Wootters

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…

An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…

Geometric Topology · Mathematics 2008-12-16 Colin Adams , Reiko Shinjo , Kokoro Tanaka

We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a…

Combinatorics · Mathematics 2024-04-26 Péter Ágoston , Gábor Damásdi , Balázs Keszegh , Dömötör Pálvölgyi

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

Combinatorics · Mathematics 2007-05-23 John C. Owen , Stephen C. Power

The art of tying knots is exploited in nature and occurs in multiple applications ranging from being an essential part of scouting programs to engineering molecular knots. Biomolecular knots, such as knotted proteins, bear various cellular…

Biological Physics · Physics 2021-06-09 Anatoly Golovnev , Alireza Mashaghi

We establish the equivalence between the family of closed uniformly regular Riemannian manifolds and the class of complete manifolds with bounded geometry.

Differential Geometry · Mathematics 2016-04-08 Marcelo Disconzi , Yuanzhen Shao , Gieri Simonett

Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…

Combinatorics · Mathematics 2018-06-14 Xiaofeng Gu

In this paper, we investigate rigid-ruling folding motions of crease-rule patterns, that is, conjugacy-preserving isometries of developable semi-discrete conjugate nets. We derive two conditions for the rigid-ruling foldability of pairs of…

Differential Geometry · Mathematics 2026-03-09 Klara Mundilova

In the search for transverse-universal knots in the standard contact structure on $\mathbb{S}^3$, we present a classification of the transverse twist knots with maximal self-linking number, that admit only overtwisted contact branched…

Geometric Topology · Mathematics 2026-01-21 Sebastian Zapata

Topology is an important determinant of the behavior of a great number of condensed-matter systems, but until recently has played a minor role in elasticity. We develop a theory for the deformations of a class of twisted non-Euclidean…

Soft Condensed Matter · Physics 2025-08-26 Carlos E. Moguel-Lehmer , Christian D. Santangelo

A buckled sheet offers a reservoir of material that can be unfurled at a later time. For sufficiently thin yet stiff materials, this geometric process has a striking mechanical feature: when the slack runs out, the material locks to further…

Soft Condensed Matter · Physics 2025-11-18 Pan Dong , Mengfei He , Nathan C. Keim , Joseph D. Paulsen

Mechanically bonded membranes of interlocked ring polymers are a significant generalization of conventional elastic sheets, where connectivity is provided by covalent bonding, and represent a promising class of topological meta-materials.…

Soft Condensed Matter · Physics 2024-06-21 Juan Luengo-Márquez , Salvatore Assenza , Cristian Micheletti

Alcoved polytopes are characterized by the property that all facet normal directions are parallel to the roots $e_i-e_j$. Unlike other prominent families of polytopes, like generalized permutahedra, alcoved polytopes are not closed under…

Combinatorics · Mathematics 2025-11-05 Nick Early , Lukas Kühne , Leonid Monin