Related papers: Graphs and links
Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…
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…
This paper is base on talks which I gave in May, 2010 at Workshop in Trieste (ICTP). In the first part we present an introduction to knots and knot theory from an historical perspective, starting from Summerian knots and ending on Fox…
We construct an extension of the Kontsevich integral of knots to knotted trivalent graphs, which commutes with orientation switches, edge deletions, edge unzips, and connected sums. In 1997 Murakami and Ohtsuki [MO] first constructed such…
The pioneering work of Jones and Kauffman unveiled a fruitful relationship between statistical mechanics and knot theory. Recently, Jones introduced two subgroups $\vec{F}$ and $\vec{T}$ of the Thompson groups $F$ and $T$, respectively,…
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…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
In this note we study a certain graph polynomial arising from a special recursion. This recursion is a member of a family of four recursions where the other three recursions belong to the chromatic polynomial, the modified matching…
In this report, I will start by first giving a brief introduction on knots to build some intuition before beginning the more rigorous review in the Literature Review section. There, I will define knot equivalence, the Jones polynomial…
The Tait conjecture states that alternating reduced diagrams of links in S^3 have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L. Kauffman and K. Murasugi studying the Jones polynomial. The author proved…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…
We utilize relations between Khovanov and chromatic graph homology to determine extreme Khovanov groups and corresponding coefficients of the Jones polynomial. The extent to which chromatic homology and chromatic polynomial can be used to…
We present in this chapter (Chapter II) the history of ideas which lead up to the development of modern knot theory. We are more detailed when pre-XX century history is reported. With more recent times we are more selective, stressing…
We formulate the holographic principle for knots and links. For the "space" of all knots and links, torus knots T(2m+1,2) and torus links L(2m,2) play the role of the "boundary" of this space. Using the holographic principle, we find the…
Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
The purpose of this paper is to discuss how topology and geometry provide, in many instances, the connective tissue that enables logical comprehension. We illustrate this theme with many examples including Venn diagrams, knot diagrams,…
We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage…