Related papers: The multivariate Tutte polynomial (alias Potts mod…
We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…
We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…
We use the equivariant cohomology ring of the permutohedral variety to study matroids and their invariants. Investigating the pushforward of matroid Chern classes defined by A. Berget, C. Eur, H. Spink and D. Tseng to the product space…
In the paper [Proceedings of the Japan Academy, Ser. A Mathematical Sciences, 95(10) 111-113], the authors introduce the concept of the Tutte polynomials of genus $g$ and announce that each matroid $M$ can be reconstructed from its Tutte…
partial abstract: The $q$-state Potts model partition function (equivalent to the Tutte polynomial) for a lattice strip of fixed width $L_y$ and arbitrary length $L_x$ has the form…
The multiplicity Tutte polynomial, which includes the arithmetic Tutte polynomial, is a generalization of the classical Tutte polynomial of matroids. In this paper, we obtain an expression of the general coefficient and the expressions of…
The catenary data of a matroid $M$ of rank $r$ on $n$ elements is the vector $(\nu(M;a_0,a_1,\ldots,a_r))$, indexed by compositions $(a_0,a_1,\ldots,a_r)$, where $a_0 \geq 0$,\, $a_i > 0$ for $i \geq 1$, and $a_0+ a_1 + \cdots + a_r = n$,…
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 number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…
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…
We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag varieties. We introduce two different generalizations, and demonstrate that each has its own merits, where the trade-off is between the ease…
Specializing the $\gamma$-basis for the vector space $\mathcal{G}(n,r)$ spanned by the set of symbols on bit sequences with $r$ $1$'s and $n-r$ $0$'s, we obtain a frame or spanning set for the vector space $\mathcal{T}(n,r)$ spanned by…
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same…
We establish two expansions of the Potts model partition function of a graph. One is along the deletions of a graph, a rewritten formula given in Biggs (1977). The other is along the contractions of a graph. Then, we specialize the…
Given a 4-regular graph $F$, we introduce a binary matroid $M_{\tau}(F)$ on the set of transitions of $F$. Parametrized versions of the Tutte polynomial of $M_{\tau}(F)$ yield several well-known graph and knot polynomials, including the…
In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new…
We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the Tutte polynomial of a binary matroid with parameters q>= 2 and gamma. (Relative to the classical (x,y)…
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…
The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the zeros of the Tutte polynomials of graphs, and show that they form a…