Related papers: Combinatorial Random Knots
The unknotting number $u$ and the genus $g$ of braid positive knots are equal, as shown by Rudolph. We prove the stronger statement that any positive braid diagram of a genus $g$ knot contains $g$ crossings, such that changing them produces…
A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by R. Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots.…
Let $K$ be a knot type for which the quadratic term of the Conway polynomial is nontrivial, and let $\gamma: \mathbb{R}\to \mathbb{R}^3$ be an analytic $\mathbb{Z}$-periodic function with non-vanishing derivative which parameterizes a knot…
We partially determine grid homology (combinatorial knot Floer homology) of diagonal knots, which are conjectured to be equivalent to positive braid knots, by exploiting nice grid diagrams. Its next-to-top term detects the number of prime…
We study random knots and links in R^3 using the Petaluma model, which is based on the petal projections developed by Adams et al. (2012). In this model we obtain a formula for the distribution of the linking number of a random…
Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via…
Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…
A coarse-grained computational model is used to investigate how the bending rigidity of a polymer under tension affects the formation of a trefoil knot. Thermodynamic integration techniques are applied to demonstrate that the free-energy…
Consider a random geometric graph $G$ with a vertex set defined by a Poisson point process with intensity $t>0$ in a convex body. We can generate a drawing of the graph by projecting the construction onto some plane $L$. Choosing different…
We investigate Feynman diagrams which are calculable in terms of generalized one-loop functions, and explore how the presence or absence of transcendentals in their counterterms reflects the entanglement of link diagram constructed from…
A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane…
The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…
A chord diagram refers to a set of chords with distinct endpoints on a circle. The intersection graph of a chord diagram $\cal C$ is defined by substituting the chords of $\cal C$ with vertices and by adding edges between two vertices…
We explore the possibility of applying the framework of frequent pattern mining to a class of continuous objects appearing in nature, namely knots. We introduce the frequent knot mining problem and present a solution. The key observation is…
Introduced recently, an n-crossing is a singular point in a projection of a link at which n strands cross such that each strand travels straight through the crossing. We introduce the notion of an \"ubercrossing projection, a knot…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…
A Seifert surface F for a knot K is free if the complement of F is a handlebody (i.e., has free fundamental group). The free genus of K is the minimum genus among all free Seifert surfaces for K. In this paper we show that there exist…
Cohomology theory of links, introduced by the author, is combinatorial. Dror Bar-Natan recently wrote a program that found ranks of cohomology groups of all prime knots with up to 11 crossings. His surprising experimental data is discussed…
We study random knots, which we define as a triple of random periodic functions (where a random function is a random trigonometric series, \[f(\theta) = \sum_{k=1}^\infty a_k \cos (k \theta) +b_k (\sin k \theta),\] with $a_k, b_k$ are…