Related papers: Knots and Links from Random Projections
Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that…
We compute the linking number of two modular knots in the space $\text{PSL}(2, \mathbb{Z})\backslash\text{PSL}(2, \mathbb{R})$ with the trefoil filled in, which answers a question posed by Ghys in 2007. This computation is realized through…
We extend the entanglement bootstrap approach to (3+1)-dimensions. We study knotted excitations of (3+1)-dimensional liquid topological orders and exotic fusion processes of loops. As in previous work in (2+1)-dimensions, we define a…
It has been conjectured by Rovelli that there is a correspondence between the space of link classes of a Riemannian 3-manifold and the space of 3-geometries (on the same manifold). An exact statement of his conjecture will be established…
We consider the problem of link prediction in networks whose edge structure may vary (sufficiently slowly) over time. This problem, with applications in many important areas including social networks, has two main variants: the first, known…
Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend on a large number of parameters -- the lengths of the bars of the linkage. Motivated by applications in topological robotics, statistical…
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known…
The Thurston-Bennequin invariant provides one notion of self-linking for any homologically-trivial Legendrian curve in a contact three-manifold. Here we discuss related analytic notions of self-linking for Legendrian knots in Euclidean…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
A virtual knot, which is one of generalizations of knots in $\mathbb{R}^{3}$ (or $S^{3}$), is, roughly speaking, an embedded circle in thickened surface $S_{g} \times I$. In this paper we will discuss about knots in 3 dimensional $S_{g}…
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
Designing mechanical devices, called linkages, that draw a given plane curve has been a topic that interested engineers and mathematicians for hundreds of years, and recently also computer scientists. Already in 1876, Kempe proposed a…
We discuss a semi-implicit numerical scheme that allows for minimizing the bending energy of curves within certain isotopy classes. To this end we consider a weighted sum of the bending energy and the tangent-point functional. Based on…
In this article we study two related models of quantum geometry: generic random trees and two-dimensional causal triangulations. The Hausdorff and spectral dimensions that arise in these models are calculated and their relationship with the…
Topological invariants such as winding numbers and linking numbers appear as charges of topological solitons in diverse nonlinear physical systems described by a unit vector field defined on two and three dimensional manifolds. While the…
We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…
A kinematic chain in three-dimensional Euclidean space consists of $n$ links that are connected by spherical joints. Such a chain is said to be within a closed configuration when its link lengths form a closed polygonal chain in three…
Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise…