Related papers: A recursive definition for the polymatroid Tutte p…
In this note we study a certain graph polynomial arising from a special recursion. This recursion is a member of a family of four recursions where the other three recursions belong to the chromatic polynomial, the modified matching…
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…
A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
Kochol (2021) gave a new expansion formula for the Tutte polynomial of a matroid using the notion of \emph{compatible sets}, and asked how this expansion relates to the internal-external activities formula. Here, we provide an answer, which…
In the present paper, we introduce the concept of harmonic Tutte polynomials of matroids and discuss some of their properties. In particular, we generalize Greene's theorem, thereby expressing harmonic weight enumerators of codes as…
The interior polynomial was originally defined for hypergraphs and later shown to coincide with the Ehrhart polynomial of the root polytope of an associated bipartite graph. In previous work, we derived an alternating cycle recursion…
A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…
We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…
Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the…
This thesis deals with the Tutte polynomial, studied from different points of view. In the first part, we address the enumeration of planar maps equipped with a spanning forest, here called forested maps, with a weight $z$ per face and a…
Cut-and-paste $K$-theory is a new variant of higher algebraic $K$-theory that has proven to be useful in problems involving decompositions of combinatorial and geometric objects, e.g., scissors congruence of polyhedra and reconstruction…
In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…
In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of…
In this study, we present two results that relate Tutte polynomials. First, we provide new and complete polynomial invariants for graphs. We note that the number of variables of our polynomials is one. Second, let L_1 and L_2 be two…
The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic…
Matroids are ubiquitous in modern combinatorics. As discovered by Gelfand, Goresky, MacPherson and Serganova there is a beautiful connection between matroid theory and the geometry of Grassmannians: realizable matroids correspond to torus…
Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…