Related papers: The interlace polynomial of binary delta-matroids …
Let F be a 4-regular graph with an Euler system C. We introduce a simple way to modify the interlacement matrix of C so that every circuit partition P of F has an associated modified interlacement matrix M(C,P). If C and C' are Euler…
We define a new invariant of links in the $3$-sphere and call it the parabolic Dijkgraaf-Witten (DW) invariant. This invariant is a generalization of the reduced DW invariant derived by Karuo. In this paper, we compute the invariant of…
Let G be a graph with adjacency matrix A(G). Consider the matrix IA(G)=(I | A(G)), where I is the identity matrix, and let M(IA(G)) be the binary matroid represented by IA(G). Then suitably parametrized versions of the Tutte polynomial of…
We define an annular concordance invariant and study its properties. When specialized to braids, this invariant gives bounds on band rank. We introduce a modified chain complex to reformulate the invariant. Then, by focusing on a special…
Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…
Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…
We introduce the (general) homotopy groups of spheres as link invariants for Brunnian-type links through the investigations on the intersection subgroup of the normal closures of the meridians of strongly nonsplittable links. The homotopy…
In this paper we introduce two theories of finite type invariants for framed links with fixed linking matrix. We show that these thepries are related to the theory of Vassiliev invariants of framed links. We also study the corresponding…
A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.
The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
We generalize the index polynomial invariant to the case of virtual tangles. Three polynomial invariants result from this generalization; we give a brief overview of their definition and some basic properties.
We present an algebraic theory of orthogonal polynomials in several variables that includes classical orthogonal polynomials as a special case. Our bottom line is a straightforward connection between apolarity of binary forms and the inner…
Given a 4-regular graph $F$, we introduce a binary matroid $M_{\tau}(F)$ on the set of transitions of $F$. Parametrized versions of the Tutte polynomial of $M_{\tau}(F)$ yield several well-known graph and knot polynomials, including the…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
M. Niebrzydowski and J. H. Przytycki defined a Kauffman bracket magma and constructed the invariant P of framed links in 3-space. The invariant is closely related to the Kauffman bracket polynomial. The normalized bracket polynomial is…
A new link invariant is derived using the exactly solvable chiral Potts model and a generalized Gaussian summation identity. Starting from a general formulation of link invariants using edge-interaction spin models, we establish the…
If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…
An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
The interior polynomial is an invariant of (signed) bipartite graphs, and the interior polynomial of a plane bipartite graph is equal to a part of the HOMFLY polynomial of a naturally associated link. The HOMFLY polynomial $P_L(v,z)$ is a…