Related papers: Twisting Uneven Ropes
Let S be a triangulated 2-sphere with fixed triangulation T. We apply the methods of thin position from knot theory to obtain a simple version of the three geodesics theorem for the 2-sphere [5]. In general these three geodesics may be…
A universality class describing the statistics of the merging of two single polymer strands to a double polymer strand and the reverse process is examined. The polymers can have an intrinsic direction, and the simpler case, where only…
The deformation of a soft substrate by a straight contact line is calculated, and the result applied to a static rivulet between two parallel contact lines. The substrate is supposed to be incompressible (Stokes like description of…
The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…
A new general equation to explain bending of arbitrary rods (from arbitrary materials, cross sections, densities, strengthnesses, bending angles, etc) was proposed. This equation can solve several problems found in classical equations,…
Networks of elastic beams can deform either by stretching or bending of their members. The primary mode of deformation (bending or stretching) crucially depends on the specific details of the network architecture. In order to shed light on…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
The statistical mechanics of a ribbon polymer made up of two semiflexible chains is studied using both analytical techniques and simulation. The system is found to have a crossover transition at some finite temperature, from a type of short…
The compression of soft elastic matter and biological tissue can lead to creasing, an instability where a surface folds sharply into periodic self-contacts. Intriguingly, the unfolding of the surface upon releasing the strain is usually not…
The stretching of a polymer chain by a large scale chaotic flow is considered. The steady state which emerges as a balance of the turbulent stretching and anharmonic resistance of the chain is quantitatively described, i.e. the dependency…
In this paper, we study the necessary conditions and sufficient conditions for the twisted angles of the central configurations formed by two twisted regular polygons, specially, we prove that for the 2N-body problems, the twisted angles…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
Snapping of a slender structure is utilized in a wide range of natural and man-made systems, mostly to achieve rapid movement without relying on muscle-like elements. Although several mechanisms for elastic energy storage and rapid release…
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…
Rotation distance measures the difference in shape between binary trees of the same size by counting the minimum number of rotations needed to transform one tree to the other. We describe several types of rotation distance where…
The dynamics of a single chain tethered to an interface and in contact with a cross-linked network is examined numerically. When the network is put in contact with the tethered chain, the chain moves with dynamics that are highly…
We reduce the earlier known optimal shear parameter for which ergodicity is established in the linked twist map with two linear shears in opposite sense, in the most general setting. Further, here we obtain ergodicity with possibly only…
Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint…
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…