Related papers: Knotting probabilities after a local strand passag…
Physical knot classification is a challenging fine-grained recognition task in which the intended discriminative cue is rope crossing structure; however, high closed-set accuracy may still arise from low-level appearance shortcuts rather…
We argue that the mean crossing number of a random polymer configuration is simply a measure of opacity, without being closely related to entanglement as claimed by several authors. We present an easy way of estimating its asymptotic…
We present a rough estimation -- up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs. the occupation probability -- of the critical occupation probabilities for the…
We show an $\widetilde{O}(m^{1.5} \epsilon^{-1})$ time algorithm that on a graph with $m$ edges and $n$ vertices outputs its spanning tree count up to a multiplicative $(1+\epsilon)$ factor with high probability, improving on the previous…
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
We introduce a simple geometrical construction similar to covariant holographic entanglement entropy but with the addition of a new term proportional to boundary region volume. This new procedure has properties strongly resembling classical…
We use the bond fluctuation model to study the contraction process of two polymer loops with $N$ segments that are connected each to the bottom and top part of a Feringa engine. The change in the size of the molecules as well as the folding…
For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…
In this article, we generalize known formulas for crossing probabilities. Prior crossing results date back to J. Cardy's prediction of a formula for the probability that a percolation cluster in two dimensions connects the left and right…
In this paper we investigate the dynamical behavior of an interface or polymer, in interaction with a distant attractive substrate. The interface is modeled by the graph of a nearest neighbor path with non-negative integer coordinates, and…
Several nontrivial properties are shown for the mean square radius of gyration $R_K^2$ of ring polymers with a fixed knot type K. Through computer simulation, we discuss both finite-size and asymptotic behaviors of the gyration radius under…
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…
The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…
A linear polymer grafted to a hard wall and underneath an AFM tip can be modelled in a lattice as a grafted lattice polymer (or self-avoiding walk) compressed underneath a piston approaching the wall. As the piston approaches the wall the…
In "Width complexes for knots and 3-manifolds," Jennifer Schultens defines the width complex for a knot in order to understand the different positions a knot can occupy in the 3-sphere and the isotopies between these positions. She poses…
For a polygonal knot K, it is shown that a tube of radius R(K), the polygonal thickness radius, is an embedded torus. Given a thick configuration K, perturbations of size r<R(K) define satellite structures, or local knotting. We explore…
In this paper we address the problem of testing whether two observed trees $(t,t')$ are sampled either independently or from a joint distribution under which they are correlated. This problem, which we refer to as correlation detection in…
We have analysed the recently extended series for the number of self-avoiding walks (SAWs) $C_L(1)$ that cross an $L \times L$ square between diagonally opposed corners. The number of such walks is known to grow as $\lambda_S^{L^2}.$ We…
We construct the first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible. It has only 15 vertices. We exhibit a second 3-ball B_{12,38} with 12 vertices that is collapsible and evasive, but not shellable. Finally, we…
We study \emph{local computation algorithms (LCAs)} for constructing spanning trees. In this setting, the goal is to locally determine, for each edge $ e \in E $, whether it belongs to a spanning tree $ T $ of the input graph $ G $, where $…