Related papers: Skew characteristic polynomial of graphs and embed…
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…
Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…
Skew pentagram maps act on polygons by intersecting diagonals of different lengths. They were introduced by Khesin-Soloviev in 2015 as conjecturally non-integrable generalizations of the pentagram map, a well-known integrable system. In…
In this paper, we unify the Markov theory of a variety of different types of graphs used in graphical Markov models by introducing the class of loopless mixed graphs, and show that all independence models induced by $m$-separation on such…
Colored HOMFLY-PT invariant, the generalization of the colored Jones polynomial, is one of the most important quantum invariants of links. This paper is devoted to investigating the basic structures of the colored HOMFLY-PT invariants of…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial…
We define a $\mathbb{Z}_2$-valued invariant for transversely-intersecting coassociative $4$-folds equipped with spin structures. Our main result shows this invariant provides an obstruction to separating two such coassociatives through a…
The aim of this paper is two fold: First to study finite groups $G$ of automorphisms of the homogenized Weyl algebra $B_{n}$, the skew group algebra $B_{n}\ast G$, the ring of invariants $B_{n}^{G}$, and the relations of these algebras with…
The aim of this paper is to define two link invariants satisfying cubic skein relations. In the hierarchy of polynomial invariants determined by explicit skein relations they are the next level of complexity after Jones, HOMFLY, Kauffman…
Our main result has topological, combinatorial and computational flavor. It is motivated by a fundamental conjecture stating that computing Khovanov homology of a closed braid of fixed number of strands has polynomial time complexity. We…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
The Jones polynomial is a famous link invariant that can be defined diagrammatically via a skein relation. Khovanov homology is a richer link invariant that categorifies the Jones polynomial. Using spectral sequences, we obtain a skein-type…
We consider an algebra of (classical or virtual) tangles over an ordered circuit operad and introduce Conway-type invariants of tangles which respect this algebraic structure. The resulting invariants contain both the coefficients of the…
In 1983, Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and that for every spatial complete graph on seven vertices, the…
In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss…
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…
In this paper, we illustrate important aspects of the interplay between weighing matrices, $(v,k,\lambda)$-graphs with fixed-point free involutions, and signed graphs with an orthogonal adjacency matrix, which arises from thin divisible…
We prove a finiteness property of the values of the skein polynomial of homogeneous knots which allows to establish large classes of such knots to have arbitrarily unsharp Bennequin inequality (for the Thurston-Bennequin invariant of any of…
Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$,…