Related papers: Gordian split links in the Gehring ropelength prob…
In this paper, we study Legendrian realizations of cable links of knot types that are uniformly thick but not Legendrian simple, extending prior work of Dalton, the second author, and Traynor. This leads to new phenomena, such as stabilized…
For every $n \ge 3$, we construct 2-component links in $S^{n+1}$ that are a split by an integer homology $n$-sphere, but not by $S^n$. In the special case $n=3$, i.e. that of 2-links in $S^4$, we produce an infinite family of links $L_\ell$…
A 2-component oriented link in $S^3$ is called weakly doubly slice if it is a cross-section of an unknotted sphere in $S^4$, and strongly doubly slice if it is a cross-section of a 2-component trivial spherical link in $S^4$. We give the…
We define a notion of finite type invariants for links with a fixed linking matrix. We show that Milnor's triple link homotopy invariant is a finite type invariant, of type 1, in this sense. We also generalize the approach to Milnor's…
Links of singularity and generalized algebraic links are ways of constructing three-manifolds and smooth links inside them from potentially singular complex algebraic surfaces and complex curves inside them. We prove that knot lattice…
Graph partitioning (GP) and vertex connectivity have traditionally been two distinct fields of study. This paper introduces the highly connected graph partitioning (HCGP) problem, which partitions a graph into compact, size balanced, and…
What length of rope (of given diameter) is required to tie a particular knot? To answer this question, we define some new notions of thickness for a space curve, one based on Gromov's distortion, and another generalizing the thickness of…
Degree heterogeneity and latent geometry, also referred to as popularity and similarity, are key explanatory components underlying the structure of real-world networks. The relationship between these components and the statistical…
Long lived topological features are distinguished from short lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and…
The cohomological rigidity problem for toric orbifolds asks when an integral cohomology isomorphism implies a homotopy equivalence. In this paper we reformulate the cohomological rigidity problem in the context of $4$-dimensional toric…
We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…
Link prediction is a paradigmatic problem in network science with a variety of applications. In latent space network models this problem boils down to ranking pairs of nodes in the order of increasing latent distances between them. The…
We give a new, elementary proof of what we believe is the simplest known example of a ``natural'' problem in computational 3-dimensional topology that is $\mathsf{NP}$-hard -- namely, the \emph{Trivial Sublink Problem}: given a diagram $L$…
We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…
Deformations of knots and links in ambient space can be studied combinatorially on their diagrams via local modifications called Reidemeister moves. While it is well-known that, in order to move between equivalent diagrams with Reidemeister…
A perturbation theory scheme in terms of electron hopping, which is based on the Wick theorem for Hubbard operators, is developed. Diagrammatic series contain single-site vertices connected by hopping lines and it is shown that for each…
We consider knotted annuli in 4-space, called 2-string-links, which are knotted surfaces in codimension two that are naturally related, via closure operations, to both 2-links and 2-torus links. We classify 2-string-links up to…
Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their…
For an $n$-component link $L$, the Milnor's isotopy invariant is defined for each multi-index $I=i_1i_2...i_m (i_j\in\n)$. Here $m$ is called the length. Let $r(I)$ denote the maximam number of times that any index appears. It is known that…