Related papers: Seifert-Tait graphs

We study the sutured Floer homology invariants of the sutured manifold obtained by cutting a knot complement along a Seifert surface, R. We show that these invariants are finer than the "top term" of the knot Floer homology, which they…

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…

In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…

We observe that there are elliptic curves over number fields all of whose quadratic twists must have positive rank, assuming the Birch-Swinnerton-Dyer conjecture. We give a classification of such curves in terms of their local behaviour,…

Several classical knot invariants, such as the Alexander polynomial, the Levine-Tristram signature and the Blanchfield pairing, admit natural extensions from knots to links, and more generally, from oriented links to so-called colored…

T\^ete-\`a-t\^ete graphs and relative t\^ete-\`a-t\^ete graphs were introduced by N. A'Campo in 2010 to model monodromies of isolated plane curves. By recent workof Fdez de Bobadilla, Pe Pereira and the author, they provide a way of…

A graph is an efficient open (resp.\ closed) domination graph if there exists a subset of vertices whose open (resp.\ closed) neighborhoods partition its vertex set. Graphs that are efficient open as well as efficient closed (shortly EOCD…

In this survey paper we present results about link diagrams in Seifert manifolds using arrow diagrams, starting with link diagrams in $F\times S^1$ and $N\hat{\times}S^1$, where $F$ is an orientable and $N$ an unorientable surface.…

We introduce defects, with internal gauge symmetries, on a knot and Seifert surface to a knot into the combinatorial construction of finite gauge-group Dijkgraaf-Witten theory. The appropriate initial data for the construction are certain…

We explicitly show that the new polynomial invariants for knots, upto nine crossings, agree with the Ooguri-Vafa conjecture relating Chern-Simons gauge theory to topological string theory on the resolution of the conifold.

Let $K$ be a genus $g$ alternating knot with Alexander polynomial $\Delta_K(T)=\sum_{i=-g}^ga_iT^i$. We show that if $|a_g|=|a_{g-1}|$, then $K$ is the torus knot $T_{2g+1,\pm2}$. This is a special case of the Fox Trapezoidal Conjecture.…

To each finitely aligned higher-rank graph $\Lambda$ and each $\mathbb{T}$-valued 2-cocycle on $\Lambda$, we associate a family of twisted relative Cuntz-Krieger algebras. We show that each of these algebras carries a gauge action, and…

We prove for a large class of knots that the meridional rank coincides with the bridge number. This class contains all knots whose exterior is a graph manifold. This gives a partial answer to a question of S. Cappell and J. Shaneson, see…

We prove that every bipartite graph of sufficiently large average degree has either a $K_{t,t}$-subgraph or an induced subgraph of average degree at least $t$ and girth at least $6$. We conjecture that "$6$" can be replaced by "$k$", which…

We show that a smaller version of the Kontsevich graph complex spanned by triconnected graphs is quasi-isomorphic to the full Kontsevich graph complex.

The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by…

We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…

We exhibit an encoding of knots into processes in the {\pi}-calculus such that knots are ambient isotopic if and only their encodings are weakly bisimilar.

We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…

Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…