Related papers: A multi-variable Alexander polynomial for a framed…
Goda showed that the twisted Alexander polynomial can be recovered from the zeta function of a matrix-weighted graph. Motivated by this, we study transformations of weighted graphs that preserve this zeta function, introducing a notion of…
Felsner introduced a cycle reversal, namely the `flip' reversal, for \alpha-orientations (i.e., each vertex admits a prescribed out-degree) of a graph G embedded on the plane and further proved that the set of all the \alpha-orientations of…
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
This is the first paper in a general program to automate skein theoretic arguments. In this paper, we study skein theoretic invariants of planar trivalent graphs. Equivalently, we classify trivalent categories, which are nondegenerate…
In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroids and determines thus a finite type…
An oriented graph $D$ is converse invariant if, for any tournament $T$, the number of copies of $D$ in $T$ is equal to that of its converse $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684-701] showed that any oriented graph…
Landry, Minsky and Taylor defined the taut polynomial of a veering triangulation. Its specialisations generalise the Teichmuller polynomial of a fibred face of the Thurston norm ball. We prove that the taut polynomial of a veering…
The permanental polynomial of a graph $G$ is $\pi(G,x)\triangleq\mathrm{per}(xI-A(G))$. From the result that a bipartite graph $G$ admits an orientation $G^e$ such that every cycle is oddly oriented if and only if it contains no even…
We define a multi-variable version of the Affine Index Polynomial for virtual links. This invariant reduces to the original Affine Index Polynomial in the case of virtual knots, and also generalizes the version for compatible virtual links…
In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…
Inferring graph structure from observations on the nodes is an important and popular network science task. Departing from the more common inference of a single graph and motivated by social and biological networks, we study the problem of…
In this paper we apply the twisted Alexander polynomial to study the fibering and genus detecting problems for oriented links. In particular we generalize a conjecture of Dunfield, Friedl and Jackson on the torsion polynomial of hyperbolic…
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…
This elementary article introduces easy-to-manage invariants of genus one knots in homology 3-spheres. To prove their invariance, we investigate properties of an invariant of 3-dimensional genus two homology handlebodies called the…
We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…
We identify the algebra of regular functions on the space of quartic polynomials in three complex variables invariant under SL(3,C) with an algebra of meromorphic automorphic forms on the complex 6-ball. We also discuss the underlying…
Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…
We present and implement an algorithm for computing the invariant circle and the corresponding stable manifolds for 2-dimensional maps. The algorithm is based on the parameterization method, and it is backed up by an a-posteriori theorem…