English
Related papers

Related papers: Convolution formulas for multivariate arithmetic T…

200 papers

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

Combinatorics · Mathematics 2024-02-13 Tsuyoshi Miezaki , Manabu Oura , Tadashi Sakuma , Hidehiro Shinohara

Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…

Combinatorics · Mathematics 2013-05-30 Federico Ardila , Federico Castillo , Michael Henley

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…

Algebraic Geometry · Mathematics 2025-09-25 Mario Bauer , Matěj Doležálek , Magdaléna Mišinová , Semen Słobodianiuk , Julian Weigert

Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…

Combinatorics · Mathematics 2020-04-02 Christopher Eur , June Huh

We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…

Combinatorics · Mathematics 2018-02-28 Amanda Cameron , Alex Fink

Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Kevin Long

The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…

Combinatorics · Mathematics 2017-10-05 Federico Ardila

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

Combinatorics · Mathematics 2017-07-13 Guus Bollen , Henry Crapo , Relinde Jurrius

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

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

We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x+y=p lying in the positive quadrant. Every coloopless paving matroids is in the class of matroids which contain two…

Combinatorics · Mathematics 2010-04-16 L. E. Chavez-Lomelí , C. Merino , S. D. Noble , M. Ramírez-Ibañez

We describe a construction of the Tutte polynomial for both matroids and $q$-matroids based on an appropriate partition of the underlying support lattice into intervals that correspond to prime-free minors, which we call a Tutte partition.…

Combinatorics · Mathematics 2024-11-12 Eimear Byrne , Andrew Fulcher

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 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

From the configuration of a matroid (which records the size and rank of the cyclic flats and the containments among them, but not the sets), one can compute several much-studied matroid invariants, including the Tutte polynomial and a…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

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

We transform Tutte-Grothedieck invariants thus also Tutte polynomials on matroids so that the contraction-deletion rule for loops (isthmuses) coincides with the general case.

Combinatorics · Mathematics 2014-11-06 Martin Kochol

For any matroid $M$, we compute the Tutte polynomial $T_M(x,y)$ using the mixed intersection numbers of certain classes in the combinatorial Chow ring $A^\bullet(M)$ arising from hypersimplices. Using the mixed Hodge-Riemann relations, we…

Algebraic Geometry · Mathematics 2023-03-27 Andrew Berget , Hunter Spink , Dennis Tseng

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