Related papers: A categorification for the Tutte polynomial
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
Mikhail Khovanov in math.QA/9908171 defined, for a diagram of an oriented classical link, a collection of groups numerated by pairs of integers. These groups were constructed as homology groups of certain chain complexes. The Euler…
We generalise to a group homomorphism $\tau$ the $\chi$-graded categories of S\"{o}zer and Virelizier. These are categories in which both morphisms and objects have compatible degrees. We give a 'half-enriched' Yoneda lemma, a structure…
We construct a family of rings. To a plane diagram of a tangle we associate a complex of bimodules over these rings. Chain homotopy equivalence class of this complex is an invariant of the tangle. On the level of Grothendieck groups this…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…
Given an $n$-vertex digraph $D$ and a labeling $\sigma:V(D)\to [n]$, we say that an arc $u\to v$ of $D$ is a descent of $\sigma$ if $\sigma(u)>\sigma(v)$. Foata and Zeilberger introduced a generating function $A_D(t)$ for labelings of $D$…
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…
Recently, Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
This paper studies Bernoulli cell complexes from the perspective of persistent homology, Tutte polynomials, and random-cluster models. Following the previous work [9], we first show the asymptotic order of the expected lifetime sum of the…
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…
Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is…
Tensor models are used nowadays for implementing a fundamental theory of quantum gravity. We define here a polynomial $\mathcal T$ encoding the supplementary topological information. This polynomial is a natural generalization of the…
The active bijection forms a package of results studied by the authors in a series of papers in oriented matroids. The present paper is intended to state the main results in the particular case, and more widespread language, of graphs. We…
We introduce a Poisson version of the graded twist of a graded associative algebra and prove that every graded Poisson structure on a connected graded polynomial ring $A:=\Bbbk[x_1,\ldots,x_n]$ is a graded twist of a unimodular Poisson…
We introduce and study the notion of the $G$-Tutte polynomial for a list $\mathcal{A}$ of elements in a finitely generated abelian group $\Gamma$ and an abelian group $G$, which is defined by counting the number of homomorphisms from…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
In this note we give a combinatorial characterization of all the unmixed bipartite graphs.
After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the…