Related papers: An Alexander polynomial for MOY graphs
We describe an alternative way of computing Alexander polynomials of knots/links, based on the Artin representation of the corresponding braids by automorphisms of a free group. Then we apply the same method to other representations of…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
The interior polynomial is an invariant of bipartite graphs, and a part of the HOMFLY polynomial of a special alternating link coincides with the interior polynomial of the Seifert graph of the link. We extend the interior polynomial to…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…
We realize a given (monic) Alexander polynomial by a (fibered) hyperbolic arborescent knot and link of any number of components, and by infinitely many such links of at least 4 components. As a consequence, a Mahler measure minimizing…
We define an invariant of graphs embedded in a three-manifold and a partition function for 2-complexes embedded in a triangulated four-manifold by specifying the values of variables in the Turaev-Viro and Crane-Yetter state sum models. In…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
The link invariant, arising from the cyclic quantum dilogarithm via the particular $R$-matrix construction, is proved to coincide with the invariant of triangulated links in $S^3$ introduced in R.M. Kashaev, Mod. Phys. Lett. A, Vol.9 No.40…
We generalize the classical study of Alexander polynomials of smooth or PL locally-flat knots to PL knots that are not necessarily locally-flat. We introduce three families of generalized Alexander polynomials and study their properties.…
We study the connections between link invariants, the chromatic polynomial, geometric representations of models of statistical mechanics, and their common underlying algebraic structure. We establish a relation between several algebras and…
We describe a multivariable polynomial invariant for certain class of non isolated hypersurface singularities generalizing the characteristic polynomial on monodromy. The starting point is an extension of a theorem due to Le Dung Trang and…
The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…
We study various specializations of the colored HOMFLY-PT polynomial. These specializations are used to show that the multivariable link invariants arising from a complex family of sl(m|n) super-modules previously defined by the authors…
The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the…
In this paper, we introduce two functions such that the subtraction corresponds to the Milnor's triple linking number; the addition obtains a new integer-valued link homotopy invariant of $3$-component links. We also have found a series of…
We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
Stanley's symmetrized chromatic polynomial is a generalization of the ordinary chromatic polynomial to a graph invariant with values in a ring of polynomials in infnitely many variables. The ordinary chromatic polynomial is a specialization…