Related papers: Gordian split links in the Gehring ropelength prob…
This paper contains two results on how homotopy limits of topological spaces interact with connectivity. The first is a formula for the connectivity of the homotopy limit of diagrams shaped over suitably finite categories, in terms of the…
A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…
Knots naturally appear in continuous dynamical systems as flow periodic trajectories. However, discrete dynamical systems are also closely connected with the theory of knots and links. For example, for Pixton diffeomorphisms, the…
A metric thickening of a given metric space $X$ is any metric space admitting an isometric embedding of $X$. Thickenings have found use in applications of topology to data analysis, where one may approximate the shape of a dataset via the…
We have recently shown that the entanglement entropy of any bipartition of a quantum state can be approximated as the sum of certain link strengths connecting internal and external sites. The representation is useful to unveil the geometry…
A differential geometric characterization of the braid-index of a link is found. After multiplication by 2pi, it equals the infimum of the sum of total curvature and total absolute torsion over holonomic representatives of the link. Upper…
Motivated by the approach of random linear codes, a new distance in the vector space over a finite field is defined as the logarithm of the "surface area" of a Hamming ball with radius being the corresponding Hamming distance. It is named…
A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…
Given an $m$-component link $L$ in $S^3$ ($m \ge 2$), we construct a family of links which are link homotopic, but not link isotopic, to $L$. Every proper sublink of such a link is link isotopic to the corresponding sublink of $L$.…
We show that every non-trivial strongly quasipositive link is smoothly concordant to infinitely many pairwise non-isotopic strongly quasipositive links. In contrast to our result, Baker conjectured that smoothly concordant strongly…
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
The thickness, NIR(K) of a knot or link K is defined to be the radius of the largest solid tube one can put around the curve without any self intersections, which is also known as the normal injectivity radius of K. For C^{1,1} curves K,…
Network embedding is a fervid topic in current networks science and observes that most real complex systems can be embedded in hidden metrics space and emerge as the geometrical property, where the geometric distance between nodes…
We construct infinite families of non-simple isotopy classes of links in overtwisted contact structures on $S^1$-bundles over surfaces. These examples include: (1) a pair of Legendrian links that are not Legendrian isotopic, but which are…
A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
We prove a version of symmetric criticality for ropelength-critical knots. Our theorem implies that a knot or link with a symmetric representative has a ropelength-critical configuration with the same symmetry. We use this to construct new…
A directed graph G (V, E) is strongly connected if and only if, for a pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is…
We predict the thermodynamic and structural behavior of solutions of long cross-linked filaments. We find that at the mean field level, the entropy of self-assembled junctions induces an effective attraction between the filaments that can…
Network design problems aim to compute low-cost structures such as routes, trees and subgraphs. Often, it is natural and desirable to require that these structures have small hop length or hop diameter. Unfortunately, optimization problems…