Related papers: On the Stretch Factor of Polygonal Chains

The stretching response of polymer chains fundamentally determines the mechanical properties of polymer networks. In this Letter, we develop a statistical mechanics model that incorporates both bond stretching and bond angle deformation,…

Let $P$ be a finite point set in $\mathbb{R}^2$ with the set of distance $n$-chains defined as $$ \Delta_n(P)=\{(|p_1-p_2|,|p_2-p_3|,\ldots,|p_n-p_{n+1}|):p_i \in P\}.$$ We show that for $2\leq n=O_{|P|}(1)$ we have $$|\Delta_n(P)|\gtrsim…

An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…

For a unit-norm frame $F = \{f_i\}_{i=1}^k$ in $\R^n$, a scaling is a vector $c=(c(1),\dots,c(k))\in \R_{\geq 0}^k$ such that $\{\sqrt{c(i)}f_i\}_{i =1}^k$ is a Parseval frame in $\R^n$. If such a scaling exists, $F$ is said to be scalable.…

As an important physical quantity to understand the internal structure of polymer chains, the structure factor is being studied both in theory and experiment. Theoretically, the structure factor of Gaussian chains have been solved…

We prove to all orders of renormalized perturbative polymer field theory the existence of a short chain expansion applying to polymer solutions of long and short chains. For a general polymer network with long and short chains we show…

Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…

We introduce a new parameter, called stretch-width, that we show sits strictly between clique-width and twin-width. Unlike the reduced parameters [BKW '22], planar graphs and polynomial subdivisions do not have bounded stretch-width. This…

Chain distance between points in a metric space is defined as the infimum of epsilon such that there is an epsilon-chain connecting these points. We call a mapping of a metric compact into the real line a chain development if it preserves…

Predicting the macroscopic mechanical behavior of polymeric materials from the micro-structural features has remained a challenge for decades. Existing theoretical models often fail to accurately capture the experimental data, due to…

In this paper, we analyze the effect of geometrical constraint on the conformational properties of an infinitely long linear semiflexible polymer chain confined in-between two constraints under good solvent condition in two dimensions. The…

Chain-like macromolecules in solution, whether biological or synthetic, transform from an extended conformation to a compact one when temperature or other system parameters change. This collapse transition is relevant in various phenomena,…

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

While stretching of most polymer chains leads to rather featureless force-extension diagrams, some, notably DNA, exhibit non-trivial behavior with a distinct plateau region. Here we propose a unified theory that connects force-extension…

Let $\mathcal{D}$ be a set of straight-line segments in the plane, potentially crossing, and let $c$ be a positive integer. We denote by $P$ the union of the endpoints of the straight-line segments of $\mathcal{D}$ and of the intersection…

We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…

We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…

Consider two independent Poisson point processes of unit intensity in the Euclidean space of dimension $d$ at least 3. We construct a perfect matching between the two point sets that is a factor (i.e., an equivariant measurable function of…

This paper discusses the elastic behavior of a single polyelectrolyte chain. A simple scaling analysis as in self avoiding walk chains are not possible, because three interplaying relevant length scales are involved, i.e., the Debye…