English
Related papers

Related papers: The Tutte polynomial via lattice point counting

200 papers

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

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.

Combinatorics · Mathematics 2016-01-13 Ada Morse

We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…

Combinatorics · Mathematics 2025-05-09 Felix Breuer , Caroline J Klivans

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…

Combinatorics · Mathematics 2011-07-26 Michele D'Adderio , Luca Moci

The Tutte polynomial is a crucial invariant of matroids. The polymatroid Tutte polynomial $\mathscr{T}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In this…

Combinatorics · Mathematics 2023-09-26 Xiaxia Guan , Xian'an Jin , Tamás Kálmán

We define and study "semimatroids", a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We show that geometric semilattices are precisely the posets of flats of semimatroids. We define and…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

The Tutte polynomial is a well-studied invariant of matroids. The polymatroid Tutte polynomial $\mathcal{J}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In…

Combinatorics · Mathematics 2022-07-12 Xiaxia Guan , Weiling Yang , Xian'an Jin

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…

Combinatorics · Mathematics 2020-10-06 Misaki Kume , Tsuyoshi Miezaki , Tadashi Sakuma , Hidehiro Shinohara

For a polymatroid $P$ over $[n]$, Bernardi, K\'{a}lm\'{a}n and Postnikov [\emph{Adv. Math.} 402 (2022) 108355] introduced the polymatroid Tutte polynomial $\mathscr{T}_{P}$ relying on the order $1<2<\cdots<n$ of $[n]$, which generalizes the…

Combinatorics · Mathematics 2024-03-12 Xiaxia Guan , Xian'an Jin

We show that computing the Tutte polynomial of a linear matroid of dimension $k$ on $k^{O(1)}$ points over a field of $k^{O(1)}$ elements requires $k^{\Omega(k)}$ time unless the \#ETH---a counting extension of the Exponential Time…

Computational Complexity · Computer Science 2020-07-29 Andreas Björklund , Petteri Kaski

In this paper, we introduce the concept of the Tutte polynomials of genus $g$ and discuss some of its properties. We note that the Tutte polynomials of genus one are well-known Tutte polynomials. The Tutte polynomials are matroid…

Combinatorics · Mathematics 2019-08-16 Tsuyoshi Miezaki , Manabu Oura , Tadashi Sakuma , Hidehiro Shinohara

We follow the example of Tutte in his construction of the dichromate of a graph (that is, the Tutte polynomial) as a unification of the chromatic polynomial and the flow polynomial in order to construct a new polynomial invariant of maps…

Combinatorics · Mathematics 2017-01-03 Andrew Goodall , Thomas Krajewski , Guus Regts , Lluis Vena

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

Combinatorics · Mathematics 2025-11-19 Vincent Brugidou

We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.

Combinatorics · Mathematics 2011-05-24 Michele D'Adderio , Luca Moci

We introduce a multiplicity Tutte polynomial M(x,y), with applications to zonotopes and toric arrangements. We prove that M(x,y) satisfies a deletion-restriction recurrence and has positive coefficients. The characteristic polynomial and…

Combinatorics · Mathematics 2010-11-10 Luca Moci

We introduce and study filtrations of a matroid on a linearly ordered ground set, which are particular sequences of nested sets. A given basis can be decomposed into a uniquely defined sequence of bases of minors, such that these bases have…

Combinatorics · Mathematics 2018-07-19 Emeric Gioan , Michel Las Vergnas

The Tutte polynomial and Derksen's $\mathcal{G}$-invariant are the universal deletion-contraction and valuative matroid and polymatroid invariants, respectively. There are only a handful of well known invariants (like the matroid…

Combinatorics · Mathematics 2025-05-16 Max Wakefield

The classical Tutte polynomial is a two-variate polynomial $T_G(x,y)$ associated to graphs or more generally, matroids. In this paper, we introduce a polynomial $\widetilde{T}_H(x,y)$ associated to a bipartite graph $H$ that we call the…

Combinatorics · Mathematics 2024-05-08 Csongor Beke , Gergely Kál Csáji , Péter Csikvári , Sára Pituk

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…

Combinatorics · Mathematics 2011-07-08 Harald Fripertinger , Marcel Wild