English
Related papers

Related papers: On the polymatroid Tutte polynomial

200 papers

This is a survey recent works on topological extensions of the Tutte polynomial.

Combinatorics · Mathematics 2017-08-29 Sergei Chmutov

We characterise the digraphs for which the multipaths, that is disjoint unions of directed paths, yield a matroid. For such graphs, called MP-digraphs, we prove that the Tutte polynomial of the multipath matroid is related to counting…

Combinatorics · Mathematics 2024-09-24 Luigi Caputi , Carlo Collari , Sabino Di Trani

The multivariate Tutte polynomial $\hat Z_M$ of a matroid $M$ is a generalization of the standard two-variable version, obtained by assigning a separate variable $v_e$ to each element $e$ of the ground set $E$. It encodes the full structure…

Combinatorics · Mathematics 2012-05-25 Adam Bohn , Peter J. Cameron , Peter Müller

Fix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to (m,r) and that remain in the region bounded by P and Q can be identified with…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier , Marc Noy

We introduce the ``trivariate Tutte polynomial" of a signed graph as an invariant of signed graphs up to vertex switching that contains among its evaluations the number of proper colorings and the number of nowhere-zero flows. In this, it…

Combinatorics · Mathematics 2022-03-01 Andrew Goodall , Bart Litjens , Guus Regts , Lluis Vena

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

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$,…

Combinatorics · Mathematics 2025-02-13 Joseph E. Bonin , Joseph P. S. Kung

Using a quantum field theory renormalization group-like differential equation, we give a new proof of the recipe theorem for the Tutte polynomial for matroids. The solution of such an equation is in fact given by some appropriate characters…

Combinatorics · Mathematics 2013-08-20 Gérard H. E. Duchamp , Nguyen Hoang-Nghia , Thomas Krajewski , Adrian Tanasa

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

There are several different extensions of the Tutte polynomial to graphs embedded in surfaces. To help frame the different options, here we consider the problem of extending the Tutte polynomial to cellularly embedded graphs starting from…

Combinatorics · Mathematics 2025-02-24 Iain Moffatt

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…

Combinatorics · Mathematics 2022-11-29 Himadri Shekhar Chakraborty , Tsuyoshi Miezaki , Manabu Oura

Let A be a (central) arrangement of hyperplanes in a finite dimension complex vector space V. Let M(A) be the dependence matroid determined by A. The Orlik-Solomon algebra OS(M) of a matroid M is the exterior algebra on the points modulo…

Combinatorics · Mathematics 2012-01-19 Raul Cordovil , David Forge

We associate a quotient of superspace to any hyperplane arrangement by considering the differential closure of an ideal generated by powers of certain homogeneous linear forms. This quotient is a superspace analogue of the external…

Combinatorics · Mathematics 2024-04-03 Brendon Rhoades , Vasu Tewari , Andy Wilson

In this work, we study matroids over a domain and several classical combinatorial and algebraic invariants related. We define their Grothendieck-Tutte polynomial $T_{\mathcal{M}}(x,y)$, extending the definition given by Fink and Moci in…

Combinatorics · Mathematics 2019-09-04 Alessio Borzì , Ivan Martino

Let $T(G;X,Y)$ be the Tutte polynomial for graphs. We study the sequence $t_{a,b}(n) = T(K_n;a,b)$ where $a,b$ are non-negative integers, and show that for every $\mu \in \N$ the sequence $t_{a,b}(n)$ is ultimately periodic modulo $\mu$…

Combinatorics · Mathematics 2023-06-22 Tomer Kotek , Johann A. Makowsky

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

We introduce the active partition of the ground set of an oriented matroid perspective (or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share…

Combinatorics · Mathematics 2018-07-19 Emeric Gioan

We prove several theorems concerning Tutte polynomials $T(G,x,y)$ for recursive families of graphs. In addition to its interest in mathematics, the Tutte polynomial is equivalent to an important function in statistical physics, the Potts…

Mathematical Physics · Physics 2007-05-23 Shu-Chiuan Chang , Robert Shrock

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…

Combinatorics · Mathematics 2012-03-01 Joanna A. Ellis-Monaghan , Iain Moffatt

Unlike Whitney's definition of the corank-nullity generating function $T(G;x+1,y+1)$, Tutte's definition of his now eponymous polynomial $T(G;x,y)$ requires a total order on the edges of which the polynomial is a posteriori independent.…

Combinatorics · Mathematics 2019-06-11 Spencer Backman