Related papers: An Alexander polynomial for MOY graphs
As a generalization of a fundamental result about the Alexander polynomial of links, we give a description of a Torres condition for the twisted Alexander polynomial of links associated to a unimodular representation.
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
The algebra of invariants for both the relativistic and nonrelativistic multispecies Vlasov-Maxwell system is examined, including the case with a fixed ion background. Invariants and their associated fluxes are obtained directly from the…
We introduce a framework to analyze knots and links in an unmarked solid torus. We discuss invariants that detect when such links are equivalent under an ambient homeomorphism, and show that the multivariable Alexander polynomial is such in…
Murakami-Ohtsuki-Yamada introduced an evaluation of certain oriented planar trivalent graphs with colored edges. This evaluation plays a key role in the evaluation of the colored HOMFLY polynomial of a link in 3-space and its…
The invariants of the Thomas and the Weyl type for a mapping between non-symmetric affine connection spaces are obtained with respect to the factored deformation tensor in this paper. Motivated by two invariants of the Weyl type obtained in…
The definition of the Jones polynomial in the 80's gave rise to a large family of so-called quantum link invariants, based on quantum groups. These quantum invariants are all controlled by the same two-variable invariant (the HOMFLY-PT…
We extend Milnor's mu-invariants of link homotopy to ordered (classical or virtual) tangles. Simple combinatorial formulas for mu-invariants are given in terms of counting trees in Gauss diagrams. Invariance under Reidemeister moves…
In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…
Let $G$ be a permutation graph. We show that $G$ is Cohen-Macaulay if and only if $G$ is unmixed and vertex decomposable. When this is the case, we obtain a combinatorial description for the $a$-invariant of $G$. Moreover, we characterize…
Polynomial invariants constitute a dynamic and essential area of study in the mathematical theory of knots. From the pioneer Alexander polynomial, the revolutionary Jones polynomial, to the collectively discovered HOMFLYPT polynomial, just…
We construct a 2-variable link polynomial, called $W_L$, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two…
A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita…
In this paper, we prove that the ring of polynomial invariants of the Weyl group for an indecomposable and indefinite Kac-Moody Lie algebra is generated by invariant symmetric bilinear form or is trivial depending on $A$ is symmetrizable or…
Building on the approach of Bar-Natan and Van der Veen to universal knot invariants using (perturbed) Gaussian functions, we develop a Gaussian model to compute the Alexander polynomial $\Delta_{\mathcal{K}}(T)$ of an oriented knot…
We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.
In this note we define a polynomial invariant for colored links by a skein relation. It specializes to the Jones polynomial for classical links.
Closed geodesics associated with indefinite binary quadratic forms, or equivalently with real quadratic irrationals, have long been studied as geometric $\mathrm{SL}_2(\mathbb{Z})$-invariants. Building on the Birman-Williams approach to…
We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph $G$ with order n and strong defensive alliance number $a(G)$ is the polynomial $a(G;x):=\sum_{i=a(G)}^{n}\, a_i(G)\ x^i$, where $a_{k}(G)$ is…
Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…