First geometric proof of the flyping theorem.
problem Proving Tait's flyping conjecture.
method Geometric proof using Greene's characterization, Menasco's crossing ball structures, and isotopy/re-plumbing moves.
result First entirely geometric proof of Menasco-Thistlethwaite's flyping theorem.
We give a brief historical overview of the Tait conjectures, made 120 years ago in the course of his pioneering work in tabulating the simplest knots, and solved a century later using the Jones polynomial. We announce the solution, again based on a substantial study of the Jones polynomial, of one (possibly his last re…
Extends Tait conjecture to S^1xS^2 and its connected sums.
problem Proving the minimal crossing number for alternating links in S^1xS^2 and its connected sums.
method Uses the Jones polynomial and homological triviality conditions.
result Provides a complete answer for S^1xS^2 and partial results for #_g(S^1xS^2).
Tait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S^3. The proof of this version of the flyping conjecture is based on the fact that the equivalence classes wit…
Characterizes alternating links via definite surfaces, proving conjectures.
problem Understanding alternating links through definite surfaces.
method Characterization of alternating links via definite spanning surfaces.
result Established a new proof of Tait's conjecture and derived a Seifert surface result.
Extends classical results to virtual links, proving new properties of alternating and semi-alternating virtual links.
problem Classical results for virtual links, focusing on alternating and semi-alternating links.
method Inequality relating link determinant and crossing number, matrix-tree theorem, Tait conjectures for virtual and welded links.
result Alexander polynomial of almost classical alternating virtual links is alternating.
The paper develops a theory of skein adequate links in thickened surfaces and proves Tait conjectures.
problem Establishing Tait conjectures for adequate links in thickened surfaces.
method Applying Kauffman bracket skein algebras to develop a theory of skein adequate links and proving Tait conjectures.
result The crossing number is additive under connected sum for adequate links in thickened surfaces.
This paper classifies periodic weaves and their universal cover, extending Tait's conjectures.
problem Classifying periodic weaves and their universal cover in thickened surfaces.
method Introducing hyperbolic periodic weaves, extending Tait's conjectures, and using a generalized Kauffman bracket polynomial.
result Tait's conjectures are extended to minimal reduced alternating weaving motifs.
In this paper we are interested in symmetries of alternating knots, more precisely in those related to achirality. We call the following statement Tait's Conjecture on alternating -achiral knots: Let K be an alternating -achiral knot. Then there exists a minimal projection Π of K in S^2 \subset S^3 and an involution φ:…
Essential surfaces in link diagrams on surfaces are crucial for understanding link properties.
problem Understanding the essentiality of surfaces in link diagrams on surfaces.
method Proving checkerboard surfaces are π1-essential and contain no essential closed curves that are ∂-parallel.
result Checkerboard surfaces of alternating link diagrams are π1-essential and contain no essential closed curves that are ∂-parallel.
The Tait conjecture states that reduced alternating diagrams of links in S^3 have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L.H. Kauffman and K. Murasugi studying the Jones polynomial. In this paper we prove an analogous result for alternating links in S^1xS^2 giving a complete a…
Dominant knots have isomorphic Seifert and Tait graphs.
problem Understanding knot dominance through graph isomorphism.
method Examined alternating knots and their Seifert and Tait graphs.
result Isomorphic Seifert and Tait graphs indicate dominant knots.
Proof of Tait-Kneser theorem and related variations using Lorentzian geometry.
problem Proving variations of the Tait-Kneser theorem for different conics.
method Using Lorentzian geometry to prove the theorem and its variations.
result Proof of the theorem and its variations concerning different conics.
It is conjectured that the Khovanov homology of a knot is invariant under mutation. In this paper, we review the spanning tree complex for Khovanov homology, and reformulate this conjecture using a matroid obtained from the Tait graph (checkerboard graph) G of a knot diagram K. The spanning trees of G provide a filtrat…
Moduli space linked to Tait colorings of planar graphs.
problem Understanding Tait colorings of planar graphs.
method Associated a moduli space to a planar trivalent graph and proved decomposition properties.
result The Euler characteristic of M(G) equals the number of Tait colorings of G when G is bipartite.
New instanton homology for webs counts Tait colorings.
problem Counting Tait colorings of complex webs.
method Introducing a local system of coefficients to deform instanton homology.
result Rank of deformed instanton homology equals number of Tait colorings.
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing) but the great flow of ideas started only after Jones discoveries. The first dee…
Kronheimer-Mrowka's instanton homology dimension equals Tait colorings.
problem Calculating the dimension of a specific homology group for plane trivalent graphs.
method Using SO(3) instanton Floer homology, the dimension is shown to be equal to the number of Tait colorings.
result The dimension of J#(G) is equal to the number of Tait colorings of G.
The paper studies alternating links in thickened surfaces using flow lattices and disc mutations.
problem Understanding alternating links in thickened surfaces and their invariants.
method Using integer flows on Tait graphs and disc mutations, the paper proves invariants and compares link properties.
result Found alternating knots with isometric flow lattices but different linking forms.
The Tait-Kneser theorem states that the osculating circles of a plane curve with monotonic curvature are pairwise disjoint and nested. We discuss this theorem and a number of its variations.
SU(3) instanton homology counts Tait colorings for webs and foams.
problem Counting Tait colorings for webs and foams.
method SU(3) gauge theory with structure group, eigenspace decomposition, skein exact triangles.
result SU(3) homology counts Tait colorings, Euler characteristic interpretable as polynomial invariant value.
The SO(3) instanton homology recently introduced by the authors associates a finite-dimensional vector space over the field of two elements to every embedded trivalent graph (or "web"). The present paper establishes a skein exact triangle for this instanton homology, as well as a realization of the octahedral axiom. Fr…
Polynomial algorithm found for alternating link equivalence.
problem Link equivalence of alternating links in 3-space.
method Tait flyping conjectures, observations from graph theory, and topological graph theory.
result Alternating link equivalence has a polynomial algorithm.
The goal of this paper is to address A. Shumakovitch's conjecture about the existence of Z2-torsion in Khovanov link homology. We analyze torsion in Khovanov homology of semi-adequate links via chromatic cohomology for graphs which provides a link between the link homology and well-developed theory of Hochschild ho…
Computer program constrains foam evaluation dimensions.
problem Determining dimensions of foam evaluation for nonreducible webs.
method Developed a computer program to analyze the dimension and graded dimension of J♭(K) for webs K. result Suggests dimJ♭(W1)=58 for the dodecahedral web W1 with Tait(W1)=60. The classical Tait-Kneser theorem states that the osculating circles of a smooth plane curve, free from curvature extrema, are pairwise disjoint. We prove a number of analogs of this theorem, e.g., for ovals of osculating cubics, osculating polynomials and trigonometric polynomials; in each case, we will obtain a non-d…
The paper characterizes sigma-adequacy of link diagrams using Tutte polynomials.
problem Characterizing sigma-adequacy of link diagrams.
method Using Tait graphs and Tutte polynomials.
result The number of sigma-adequate states is bounded by the number of spanning trees in the Tait graph.
The paper characterizes discrete Morse functions on knot diagrams and generalizes a clock theorem.
problem Characterizing discrete Morse functions on knot diagrams and generalizing a clock theorem.
method Using matchings on the Tait graph, the paper constructs discrete Morse functions and counts them with a formula involving the graph Laplacian. It also proves a bijection between these functions and certain rooted spanning forests.
result The paper provides a closed formula for counting discrete Morse functions and generalizes a clock theorem.
Matrix formulas for knot invariants derived from Tait graphs.
problem Computing knot invariants for alternating links.
method Squarefree matrix extraction from Tait graph vertices.
result Explicit formulas for CWRk for k≥4. There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…
We study the structure of the stable coefficients of the Jones polynomial of an alternating link. We start by identifying the first four stable coefficients with polynomial invariants of a (reduced) Tait graph of the link projection. This leads us to introduce a free polynomial algebra of invariants of graphs whose ele…
New theorem bounds link volume using surface coefficients.
problem Bounding hyperbolic volume of links on surfaces.
method Analogue of Dasbach-Lin theorem for surface links.
result Bounds on link volume from surface polynomial coefficients.
Counterexample disproves Spencer-Brown's claim about parity-pass algorithm.
problem Disproving Spencer-Brown's claim about the parity-pass algorithm and its relation to edge colorings.
method Provided a counterexample to Spencer-Brown's algorithm on non-polar pentagons.
result The parity-pass algorithm does not necessarily terminate in an extendable edge coloring.
Proves a theorem for surface links, simplifying diagrams of links.
problem Understanding minimal diagrams of surface links.
method Two-variable generalization of Jones polynomial for surface links.
result Reduced alternating diagrams of surface links have minimal crossing number.
Khovanov homology ist a new link invariant, discovered by M. Khovanov, and used by J. Rasmussen to give a combinatorial proof of the Milnor conjecture. In this thesis, we give examples of mutant links with different Khovanov homology. We prove that Khovanov's chain complex retracts to a subcomplex, whose generators are…
The flyping theorem is extended to virtual links and surfaces.
problem Proving the flyping theorem for virtual links and surfaces.
method Adapting geometric proof for thickened surfaces and using diagrammatic correspondence.
result Established an isomorphism between Gordon-Litherland pairing and 4-manifold intersection form.
Every cubic graph is a bridge trisection's 1-skeleton for a knotted surface.
problem Understanding cubic graphs and their relation to bridge trisections.
method Proving every Tait-colored cubic graph is a 1-skeleton of a bridge trisection.
result Every Tait-colored cubic graph corresponds to a bridge trisection of a knotted surface.
PhD thesis on quantum invariants and knots in 3-manifolds.
problem Quantum invariants and knots in 3-manifolds.
method Skein theory and connected sums of S^1xS^2.
result Extended Tait conjecture and Eisermann's theorem to connected sums of S^1xS^2.
New invariant CWR for alternating links is stronger than existing invariants.
problem Developing a stronger invariant for alternating links.
method Introducing CWR invariant as an array of two-variable polynomials. result The CWR invariant is stronger than classical invariants like HOMFLYPT and Kauffman polynomials. New method associates annular links to elements of Thompson's group T.
problem Associating annular links to elements of Thompson's group T.
method Edge-signed graphs embedded in annuli and unitary representations of T.
result Tait graphs of annular links can be constructed from elements of T.
We study the variation of the Tait number of a closed space curve according to its different projections. The results are used to compute the writhe of a knot, leading to a closed formula in case of polygonal curves.
New formulas derived for Jones polynomial of rational links.
problem Calculating the Jones polynomial of rational links.
method Colored Brylawski's tensor product formula for Tutte polynomials, finite automaton for crossing signs.
result Generalization of existing formulas for rational links.
We use SO(3) gauge theory to define a functor from a category of unoriented webs and foams to the category of finite-dimensional vector spaces over the field of two elements. We prove a non-vanishing theorem for this SO(3) instanton homology of webs, using Gabai's sutured manifold theory. It is hoped that the non-vanis…
The paper explores group presentations for links in thickened surfaces, proving their relationship and introducing new invariants.
problem Proving the relationship between group presentations for links in thickened surfaces.
method Combining combinatorial arguments and homological information from surfaces to establish the relationship and introduce new invariants.
result The relationship between Dehn presentations and abelian Dehn coloring groups, and the introduction of the module C as a stronger invariant. New homology theory for graphs detects subdivisions and homology manifolds.
problem Defining a dissimilarity metric for graphs.
method Filtration on simplicial homology, using bi-colourings of vertices.
result The überhomology vanishes in lowest degree for subdivisions and coincides with fundamental class for homology manifolds.
New invariant for prime alternating knots from error-correcting codes
problem Distinguishing prime alternating knots
method Alexander-Briggs code
result New invariant succeeds in separating knots that other invariants fail
We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by over…
Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work of Carter-Silver-Williams clarifies the relationship between the two focusing on how one transitions between Fox and Dehn colorings. I…