Related papers: Gordian split links in the Gehring ropelength prob…
Two links are called link-homotopic if they are transformed to each other by a sequence of self-crossing changes and ambient isotopies. The notion of link-homotopy is generalized to spatial graphs and it is called component-homotopy. The…
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem…
To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a…
High impedance connecting links and cables are modeled at low frequency in terms of their impedance to ground and to neigbouring connecting links. The impedance is usually considered to be the parallel combination of a resistance and a…
We introduce a geometric operation, which we call the relative Whitney trick, that removes a single double point between properly immersed surfaces in a $4$-manifold with boundary. Using the relative Whitney trick we prove that every link…
Halin's well-known grid theorem states that a graph $G$ with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when $G$ is vertex-transitive and locally finite. Either $G$ is…
A rope is a non-singular embedding of a closed interval into R^3, which sends the ends of the interval to some fixed points A and B such that |AB|=1. A rope is short if its length is less than 3. The main result of the paper is that the…
Define the complete n-complex on N vertices to be the n-skeleton of an (N-1)-simplex. We show that embeddings of sufficiently large complete n-complexes in R^{2n+1} necessarily exhibit complicated linking behaviour, thereby extending known…
We partially solve the conjecture by A.Shumakovitch about torsion in the Khovanov homology of prime, non-split links in S^3. We give a size restriction on the Khovanov homology of almost alternating links. We relate the Khovanov homology of…
To do homological algebra with unbounded chain complexes one needs to first find a way of constructing resolutions. Spaltenstein solved this problem for chain complexes of R-modules by truncating further and further to the left, resolving…
There is one generalization of fibered links in 3-manifolds, called homologically fibered links. It is known that the existence of homologically fibered links whose fiber surface has a given homeomorphic type is determined by the first…
In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence. This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types. More generally, it is…
The concept of 'complexity' plays a central role in complex network science. Traditionally, this term has been taken to express heterogeneity of the node degrees of a therefore complex network. However, given that the degree distribution is…
We consider Chern-Simons theory for gauge group $G$ at level $k$ on 3-manifolds $M_n$ with boundary consisting of $n$ topologically linked tori. The Euclidean path integral on $M_n$ defines a quantum state on the boundary, in the $n$-fold…
We study the interplay between entropy and topological constraints for a polymer chain in which sliding rings (slip-links) enforce pair contacts between monomers. These slip-links divide a closed ring polymer into a number of sub-loops…
Complex molecules and mesoscopic structures are naturally described by general networks of elementary building blocks and tight-binding is one of the simplest quantum model suitable for studying the physical properties arising from the…
We show that link concordance implies link homotopy for immersions of codimension at least two. As a consequence, we prove that every link $\sqcup^r S^n \hookrightarrow S^{n+2}$ is link homotopically trivial for $n\geq 2$, that is, there is…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
The entropy of a hierarchical network topology in an ensemble of sparse random networks with "hidden variables" associated to its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble.We obtain a…
As a fundamental challenge in vast disciplines, link prediction aims to identify potential links in a network based on the incomplete observed information, which has broad applications ranging from uncovering missing protein-protein…