Related papers: Locked and Unlocked Chains of Planar Shapes

A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…

Herein, we describe new methods to produce colloidal particle chains of three stiffness regimes that can be observed on a single-particle level, that is, on the level of the monomers that make up the chain; the chains can even be observed…

We give a short proof of a result of Jordan and Tanigawa that a 4-connected graph which has a spanning planar triangulation as a proper subgraph is generically globally rigid in R^3. Our proof is based on a new sufficient condition for the…

We generalize the familiar notions of overtwistedness and Giroux torsion in 3-dimensional contact manifolds, defining an infinite hierarchy of local filling obstructions called planar torsion, whose integer-valued order $k \ge 0$ can be…

Given a finite set S in $[0,1]^2$ including the origin, an anchored rectangle packing is a set of non-overlapping rectangles in the unit square where each rectangle has a point of S as its left-bottom corner and contains no point of S in…

We consider the geometric join of a family of subsets of the Euclidean space. This is a construction frequently used in the (colorful) Carath\'eodory and Tverberg theorems, and their relatives. We conjecture that when the family has at…

We generalize Jones' planar algebras by internalising the notion to a pivotal braided tensor category $\mathcal{C}$. To formulate the notion, the planar tangles are now equipped with additional `anchor lines' which connect the inner circles…

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…

We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

We prove that there are only finitely many isoparametrically foliated closed connected Riemannian manifolds with bounded geometry, fixed dimension $n\neq5$, and finite fundamental group, up to foliated diffeomorphism. In addition, we…

We introduce new families of quandles that serve as invariants for classifying closed orientable surfaces. These families generalize the classical Dehn quandle and are defined, respectively, on isotopy classes of unoriented closed curves…

We study spherical completeness of ball spaces and its stability under expansions. We introduce the notion of an ultra-diameter, mimicking diameters in ultrametric spaces. We prove some positive results on preservation of spherical…

We present a novel parabolic reflector system capable of generating a broader class of shapes beyond canonical parabolas. Using a discretized framework, we construct meshes corresponding to key families of developable surfaces, including…

Rigid particles pack into structures, such as sand dunes on the beach, whose overall stability is determined by the average number of contacts between particles. However, when packing spatially extended objects with flexible shapes,…

We study an explicit construction of planar open books with four binding components on any three-manifold which is given by integral surgery on three component pure braid closures. This construction is general, indeed any planar open book…

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

Data describing the three-dimensional structure of physical networks is increasingly available, leading to a surge of interest in network science to explore the relationship between the shape and connectivity of physical networks. We…

This paper gives a new way of characterizing L-space $3$-manifolds by using orderability of quandles. Hence, this answers a question of Adam Clay et al. [Question 1.1 of Canad. Math. Bull. 59 (2016), no. 3, 472-482]. We also investigate…