Related papers: Locked and Unlocked Polygonal Chains in 3D
In biology, there are several processes in which unfolded protein chains are transported along narrow-tube channels. Normally, without such a severe configurational constraint, unfolded polypeptides would not bind to each other. However,…
The Carpenter's Rule Theorem states that any chain linkage in the plane can be folded continuously between any two configurations while preserving the bar lengths and without the bars crossing. However, this theorem applies only to strictly…
Random packings of granular chains are presented as a model polymer system to investigate the contribution of entanglements to strain-stiffening in the absence of Brownian motion. The chain packings are sheared in triaxial compression…
We make use of the previously developed formalism for a monomer ensemble and include angular dependence of the segments of the polymer chains thus described. In particular we show how to deal with stiffness when the polymer chain is…
An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…
We propose an unexpected twist to description of the geometry and topology of configurations of n straight lines considered as a whole 3D entity (because the lines are inseparably linked pairwise while having linking numbers 1/2 or -1/2)…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…
In this exploration paper, we design algorithms for deforming and contracting a simply connected discrete closed manifold to a discrete sphere. Such a contraction is a kind of shrinking or reducing process. In our algorithms, we need to…
In this paper, we present a theory to efficiently deal with mechanical properties of heterogeneous polymer chain in free space and the central problem is to evaluate the diffusion equation and orientation-orientation correlation function,…
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most other art gallery problems, existence is the primary question:…
The convex rope problem is to find a counterclockwise or clockwise convex rope starting at the vertex a and ending at the vertex b of a simple polygon P, where a is a vertex of the convex hull of P and b is visible from infinity. The convex…
We show that numerical quasi-one-dimensional renormalization group allows accurate study of weakly coupled chains with modest computational effort. We perform a systematic comparison with exact diagonalization results in two and three-leg…
The problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones in 3D has led Bereg et al. to pose the Chain Pair Simplification problem (CPS). In this problem, given two polygonal chains…
For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…
The Searchlight Scheduling Problem was first studied in 2D polygons, where the goal is for point guards in fixed positions to rotate searchlights to catch an evasive intruder. Here the problem is extended to 3D polyhedra, with the guards…
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…
We study the continuous motion of smooth isometric embeddings of a planar surface in three-dimensional Euclidean space, and two related discrete analogues of these embeddings, polygonal embeddings and flat foldings without interior…
A polymer chain confined in nano-scale geometry has been used to investigate the underlying mechanism of Nuclear Pore Complex (NPC), where transport of cargoes is directional. It was shown here that depending on the solvent quality (good or…
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…