English
Related papers

Related papers: The Tutte q-Polynomial

200 papers

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 give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…

Combinatorics · Mathematics 2009-09-15 Joseph P. S. Kung

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

The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…

Combinatorics · Mathematics 2019-02-04 Clément Dupont , Alex Fink , Luca Moci

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

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…

Combinatorics · Mathematics 2024-02-06 Xian'an Jin , Tianlong Ma , Weiling Yang

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

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

We give a convolution formula for the Tutte polynomial T_M (x,y) of a matroid M.

Combinatorics · Mathematics 2007-05-23 W. Kook , V. Reiner , Dennis Stanton

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

This is a chapter destined for the book "Handbook of the Tutte Polynomial". The chapter is a composite. The first part is a brief introduction to Orlik-Solomon algebras. The second part sketches the theory of evaluative functions on matroid…

Combinatorics · Mathematics 2017-11-27 Michael J. Falk , Joseph P. S. Kung

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

Employing two models, we show that various counting functions of a random variable defined by restriction or contraction of a ranked set with multiplicity (e.g., classical and arithmetic matroids) have expectations given by the…

Combinatorics · Mathematics 2020-03-17 Tan Nhat Tran

A $q$-rank function is a real-valued function defined on the subspace lattice that is non-negative, upper bounded by the dimension function, non-drecreasing, and satisfies the submodularity law. Each such function corresponds to the rank…

Combinatorics · Mathematics 2025-05-27 Gianira N. Alfarano , Sebastian Degen

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

Computational Complexity · Computer Science 2013-08-01 Leslie Ann Goldberg , Mark Jerrum

The Tutte polynomial is an important invariant of graphs and matroids. Chen and Guo \emph{[Adv. in Appl. Math. 166 (2025) 102868.]} proved that for a $(k+1)$-edge connected graph $G$ and for any $i$ with $0\leq i <\frac{3(k+1)}{2}$,…

Combinatorics · Mathematics 2025-09-29 Xiaxia Guan , Xian'an Jin , Tianlong Ma , Weihua Yang

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

Combinatorics · Mathematics 2025-11-27 Sebastian Degen , Lukas Kühne

The $OS$ algebra $A$ of a matroid $M$ is a graded algebra related to the Whitney homology of the lattice of flats of $M$. In case $M$ is the underlying matroid of a hyperplane arrangement \A in $\C^r$, $A$ is isomorphic to the cohomology…

Combinatorics · Mathematics 2007-05-23 Carrie Eschenbrenner , Michael Falk

We consider tiling rectangles of size 4m x 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is…

Combinatorics · Mathematics 2007-08-30 Jesper Lykke Jacobsen

In contrast to matroids, vf-safe delta-matroids have three kinds of minors and are closed under the operations of twist and loop complementation. We show that the delta-matroids representable over GF(4) with respect to the nontrivial…

Combinatorics · Mathematics 2014-05-16 Robert Brijder , Hendrik Jan Hoogeboom