Related papers: Interior polynomial for signed bipartite graphs an…
We provide methods to compute the colored HOMFLY polynomials of knots and links with symmetric representations based on the linear skein theory. By using diagrammatic calculations, several formulae for the colored HOMFLY polynomials are…
We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…
We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…
We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…
We introduce a polynomial invariant of graphs on surfaces, $P_G$, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for $P_G$, analogous to the duality for the Tutte…
The purpose of this paper is to interpret polynomial invariants of strongly invertible links in terms of Khovanov homology theory. To a divide, that is a proper generic immersion of a finite number of copies of the unit interval and circles…
A bipartite graph G is known to be Pfaffian if and only if it does not contain an even subdivision H of $K_{3,3}$ such that $G - VH$ contains a 1-factor. However a general characterisation of Pfaffian graphs in terms of forbidden subgraphs…
Temperley-Lieb algebras have been generalized to sl(3) web spaces. Since a cubic bipartite planar graph with suitable directions on edges is a web, the quantum sl(3) invariants naturally extend to all cubic bipartite planar graphs. First we…
An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…
As an extension of positive and almost positive diagrams and links, we study two classes of links we call successively almost positive and weakly successively almost positive links. We prove various properties of polynomial invariants and…
An A-type coefficient polynomial introduced by Kawauchi recovers the HOMFLY-PT polynomial as a formal power series within skein theory. A notable feature of this construction is that each coefficient defines a link invariant, yielding an…
We construct an endomorphism of the Khovanov invariant to prove H-thinness and pairing phenomena of the invariants for alternating links. As a consequence, it follows that the Khovanov invariant of an oriented nonsplit alternating link is…
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the…
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…
We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…
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…
It is well known that any link can be represented by the closure of a braid. The minimum number of strings needed in a braid whose closure represents a given link is called the braid index of the link and the well known…