相关论文: Graphs and links

We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…

Graphs are fundamental objects that find widespread applications across computer science and beyond. Graph Theory has yielded deep insights about structural properties of various families of graphs, which are leveraged in the design and…

In this article we shall give an account of certain developments in knot theory which followed upon the discovery of the Jones polynomial in 1984. The focus of our account will be recent glimmerings of understanding of the topological…

This paper is a memory of the work and influence of Vaughan Jones. It is an exposition of the remarkable breakthroughs in knot theory and low dimensional topology that were catalyzed by his work. The paper recalls the inception of the Jones…

The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…

This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…

In 1898, Tait asserted several properties of alternating knot diagrams. These assertions became known as Tait's conjectures and remained open until the discovery of the Jones polynomial in 1985. The new polynomial invariants soon led to…

The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic…

The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…

A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…

A categorification of a polynomial link invariant is an homological invariant which contains the polynomial one as its graded Euler characteristic. This field has been initiated by Khovanov categorification of the Jones polynomial. Later,…

The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…

In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

In this chapter (Chapter III) we introduce the concept of Conway algebras (the notion related to entropic magmas) and describe invariants of links yielded by (partial) Conway algebras (including the Homflypt polynomial and signatures). We…

The altenating knots, links and twists projected on the S_2 sphere are identified with the phase Space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossing points, the edges, to the…

An elementary introduction to knot theory and its link to quantum field theory is presented with an intention to provide details of some basic calculations in the subject, which are not easily found in texts. Study of Chern-Simons theory…

We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…

Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…

The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…