Related papers: Introduction to Graph-Link Theory

For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to the signs. If a virtual link can occur in this way then we…

This is a recreational paper showing that certain linked graphs cannot be separated. The proofs employ elementary covering space theory, an appeal to a theorem of Scharlemann (concerning the band sums of two unknots), and a Jones polynomial…

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the…

This paper contains general formulae for the reduced relative Tutte, Kauffman bracket and Jones polynomials of families of virtual knots and links given in Conway notation and discussion of a counterexample to the Z-move conjecture of Fenn,…

In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.

Given any unoriented link diagram, a group of new knot invariants are constructed. Each of them satisfies a generalized 4 term skein relation. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations…

The theory of welded and extended welded knots is a generalization of classical knot theory. Welded (resp. extended welded) knot diagrams include virtual crossings (resp. virtual crossings and wen marks) and are equivalent under an extended…

In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…

We generalize the colored Jones polynomial to $4$-valent graphs. This generalization is given as a sequence of invariants in which the first term is a one variable specialization of the Kauffman-Vogel polynomial. We use the invariant we…

We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…

This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and…

Recent developments in quantum chemistry, perturbative quantum field theory, statistical physics or stochastic differential equations require the introduction of new families of Feynman-type diagrams. These new families arise in various…

Multi-virtual knot theory was introduced in $2024$ by the first author. In this paper, we initiate the study of algebraic invariants of multi-virtual links. After determining a generating set of (oriented) multi-virtual Reidemeister moves,…

A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by R. Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots.…

We investigate Feynman diagrams which are calculable in terms of generalized one-loop functions, and explore how the presence or absence of transcendentals in their counterterms reflects the entanglement of link diagram constructed from…

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 introduce a class of links whose bracket polynomials admit an expansion over perfect matchings of a plane bipartite graph. This class includes 2-bridge links, pretzel links, and Montesinos links. Our first main result (Theorem A)…

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

Multiplex networks allow us to study a variety of complex systems where nodes connect to each other in multiple ways, for example friend, family, and co-worker relations in social networks. Link prediction is the branch of network analysis…