Related papers: On the Stretch Factor of Polygonal Chains
A formula is derived for stiffness of a polymer chain in terms of the distribution function of end-to-end vectors. This relationship is applied to calculate the stiffness of Gaussian chains (neutral and carrying electric charges at the…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
A Poisson point process of unit intensity is placed in the square $[0,n]^2$. An increasing path is a curve connecting $(0,0)$ with $(n,n)$ which is non-decreasing in each coordinate. Its length is the number of points of the Poisson process…
In this brief report, we revisit analytical calculation [Mishra, {\it et al.}, Physica A {\bf 323} (2003) 453 and Mishra, NewYork Sci. J. {\bf{3(1)}} (2010) 32.] of the persistent length of a semiflexible homopolymer chain in %the extremely…
A spanning subgraph $F$ of $G$ is called a path factor if every component of $F$ is a path of order at least 2. Let $k\geq2$ be an integer. A $P_{\geq k}$-factor of $G$ means a path factor in which every component has at least $k$ vertices.…
An independent random cascade measure is specified by a random generator, a vector of dimension c with non-negative components. The dimension c is called the branching cascade parameter. It is shown under certain restrictions that, if this…
Let ${\cal P}$ be a set of $n$ points embedded in the plane, and let ${\cal C}$ be the complete Euclidean graph whose point-set is ${\cal P}$. Each edge in ${\cal C}$ between two points $p, q$ is realized as the line segment $[pq]$, and is…
The aim of this paper is to investigate the distribution of a continuous polymer in the presence of an attractive finitely supported potential. The most intricate behavior can be observed if we simultaneously and independently vary two…
The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation is one of the longstanding open problems in computational geometry. Over the years, a series of upper and…
Stress-strain relations for random packings of entangling chains under triaxial compression can exhibit strain stiffening and sustain stresses several orders-of-magnitude beyond typical granular materials. X-ray tomography reveals the…
Let S_n:=a_1\vp_1+...+a_n\vp_n, where \vp_1,...,\vp_n are independent Rademacher random variables (r.v.'s) and a_1,...,a_n are any real numbers such that a_1^2+...+a_n^2=1. Let Z be a standard normal r.v. It is proved that the best constant…
We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discounting highly stretched edges by taking their $p$-th power for…
A curve $\gamma$ that connects $s$ and $t$ has the increasing chord property if $|bc| \leq |ad|$ whenever $a,b,c,d$ lie in that order on $\gamma$. For planar curves, the length of such a curve is known to be at most $2\pi/3 \cdot |st|$.…
We consider the numerical taxonomy problem of fitting a positive distance function ${D:{S\choose 2}\rightarrow \mathbb R_{>0}}$ by a tree metric. We want a tree $T$ with positive edge weights and including $S$ among the vertices so that…
We consider the motion of a Brownian particle in $\mathbb{R}$, moving between a particle fixed at the origin and another moving deterministically away at slow speed $\epsilon>0$. The middle particle interacts with its neighbours via a…
The equilibrium partitioning of linear polymer chains into flexible polymer networks is governed by intricate entropic constraints arising from configurational degrees of freedom of both chains and network, yet a quantitative understanding…
Polymers at the interface exhibit frustrated chain conformation distinct from the bulk, impacting particle dispersion and properties of polymer nanocomposites (PNCs). Utilizing bimodal molecular weight (MW) PNCs, we observed unusual chain…
Knowing a sequence of moments of a given, infinitely supported, distribution we obtain quickly: coefficients of the power series expansion of monic polynomials $\left\{ p_{n}\right\} _{n\geq 0}$ that are orthogonal with respect to this…
Motivated by multipath routing, we introduce a multi-connected variant of spanners. For that purpose we introduce the $p$-multipath cost between two nodes $u$ and $v$ as the minimum weight of a collection of $p$ internally vertex-disjoint…
In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…