Related papers: The Tait conjecture in S^1xS^2

The Alexander polynomial (1928) is the first polynomial invariant of links devised to help distinguish links up to isotopy. Fox's conjecture (1962) -- stating that the absolute values of the coefficients of the Alexander polynomial for any…

Let $G=(V,E)$ be a strongly connected graph with $|V|\geq 3$. For $T\subseteq V$, the strongly connected graph $G$ is $2$-T-connected if $G$ is $2$-edge-connected and for each vertex $w$ in $T$, $w$ is not a strong articulation point. This…

We prove that the detection rate of n-crossing alternating links by many standard link invariants decays exponentially in n, implying that they detect alternating links with probability zero. This phenomenon applies broadly, in particular…

We show that the Andrews-Curtis conjecture holds for all balanced presentations of the trivial group corresponding to Heegaard diagrams of $S^3$.

The Jones polynomial $V_{L}(t)$ for an oriented link $L$ is a one-variable Laurent polynomial link invariant discovered by Jones. For any integer $n\ge 3$, we show that: (1) the difference of Jones polynomials for two oriented links which…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…

The Links--Gould invariant $\mathrm{LG}(L ; t_0, t_1)$ of a link $L$ is a two-variable quantum generalization of the Alexander--Conway polynomial $\Delta_L(t)$ and has been shown to share some of its most geometric features in several…

We extend the results of our previous paper from knots to links by using a formula for the Jones polynomial of a link derived recently by N. Reshetikhin. We illustrate this formula by an example of a torus link. A relation between the…

Recent advances in Quantum Topology assign $q$-series to knots in at least three different ways. The $q$-series are given by generalized Nahm sums (i.e., special $q$-hypergeometric sums) and have unknown modular and asymptotic properties.…

The purpose of this paper is to present a certain combinatorial method of constructing invariants of isotopy classes of oriented tame links. This arises as a generalization of the known polynomial invariants of Conway and Jones. These…

We show that there exist knots K in S^3 with g(E(K))=2 and g(E(K#K#K))=6. Together with Theorem~1.5 of [1], this proves existence of counterexamples to Morimoto's Conjecture (Conjecture 1.5 of [2]). This is a special case of…

A virtual link may be defined as an equivalence class of diagrams, or alternatively as a stable equivalence class of links in thickened surfaces. We prove that a minimal crossing virtual link diagram has minimal genus across representatives…

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic…

In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called…

In this paper we introduce and study the theories of pseudo links and singular links in the Solid Torus, ST. Pseudo links are links with some missing crossing information that naturally generalize the notion of knot diagrams, and that have…

Tutte (1961) proved the chain theorem for simple $3$-connected graphs with respect to minors, which states that every simple $3$-connected graph $G$ has a simple $3$-connected minor with one edge fewer than $G$, unless $G$ is a wheel graph.…

In 1971, Tutte wrote in an article that "it is tempting to conjecture that every 3-connected bipartite cubic graph is hamiltonian". Motivated by this remark, Horton constructed a counterexample on 96 vertices. In a sequence of articles by…

Topological polymers have various topological types, and they are expressed by graphs. However, the Jones polynomial, we have a difficulty to compute it; computational time is growing exponentially with respect to the crossing number. The…

In 1975, Bollob\'{a}s, Erd\H{o}s, and Szemer\'{e}di asked for the smallest $\tau$ such that an $n \times n \times n$ tripartite graph with minimum degree $n + \tau$ must contain $K_{t, t, t}$, conjecturing that $\tau = \mathcal{O}(n^{1/2})$…