Related papers: Links, bridge number, and width trees
Recent progress in string theory has led to a reformulation of quantum-group polynomial invariants for knots and links into new polynomial invariants whose coefficients can be understood in topological terms. We describe in detail how to…
We show that the bridge number of a $t$ bridge knot in $S^3$ with respect to an unknotted genus $t$ surface is bounded below by a function of the distance of the Heegaard splitting induced by the $t$ bridges. It follows that for any natural…
We investigate several integer invariants of curves in 3-space. We demonstrate relationships of these invariants to crossing number and to total curvature.
Given a link in $S^3$ we will use invariants derived from the Alexander module and the Blanchfield pairing to obtain lower bounds on the Gordian distance between links, the unlinking number and various splitting numbers. These lower bounds…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
In this paper, we introduce two functions such that the subtraction corresponds to the Milnor's triple linking number; the addition obtains a new integer-valued link homotopy invariant of $3$-component links. We also have found a series of…
We relate certain abelian invariants of a knot, namely the Alexander polynomial, the Blanchfield form, and the Arf invariant, to intersection data of a Whitney tower in the 4-ball bounded by the knot. We also give a new 3-dimensional…
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
Many recent works address the question of characterizing induced obstructions to bounded treewidth. In 2022, Lozin and Razgon completely answered this question for graph classes defined by finitely many forbidden induced subgraphs. Their…
The conormal lift of a link $K$ in $\R^3$ is a Legendrian submanifold $\Lambda_K$ in the unit cotangent bundle $U^* \R^3$ of $\R^3$ with contact structure equal to the kernel of the Liouville form. Knot contact homology, a topological link…
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear…
The goal of this paper is to give a diagrammatical characterization of the information given by the Milnor invariants of links and string links. More precisely, we describe when two string links have equal Milnor invariants of length $\leq…
In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.
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…
Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be…
The aim of this paper is to realise the techniques of picture-valued invariants and invariants valued in free groups for long knots in the full torus. Such knots and links are of a particular interest because of their relation to Legendrian…
Let $k\geq2$ be an integer. A tree $T$ is called a $k$-tree if $d_T(v)\leq k$ for each $v\in V(T)$, that is, the maximum degree of a $k$-tree is at most $k$. Let $\lambda_1(D(G))$ denote the distance spectral radius in $G$, where $D(G)$…
The Meridional Rank Conjecture asks whether the bridge number of a knot in $S^3$ is equal to the minimal number of meridians needed to generate the fundamental group of its complement. In this paper we investigate the analogous conjecture…