English
Related papers

Related papers: Algebra and valuations related to the Tutte polyno…

200 papers

In this paper we build an Orlik-Solomon model for the canonical gradation of the cohomology algebra with integer coefficients of the complement of a toric arrangement. We give some results on the uniqueness of the representation of…

Algebraic Topology · Mathematics 2020-07-20 Roberto Pagaria

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

This is a survey on the exact complexity of computing the Tutte polynomial. It is the longer 2017 version of Chapter 25 of the CRC Handbook on the Tutte polynomial and related topics, edited by J. Ellis-Monaghan and I. Moffatt, which is due…

Computational Complexity · Computer Science 2019-10-22 Tomer Kotek , Johann A. Makowsky

The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal property that essentially any multiplicative graph or network invariant with a deletion and contraction reduction must be an evaluation of…

Combinatorics · Mathematics 2012-03-02 Criel Merino , Marcelino Ramírez-Ibáñez , Guadalupe Rodríguez Sanchez

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…

Combinatorics · Mathematics 2008-06-28 Joanna Ellis-Monaghan , Criel Merino

The Tutte polynomial is a significant invariant of graphs and matroids. It is well-known that it has three equivalent definitions: bases expansion, rank generating function, and deletion-contraction formula. The polymatroid Tutte polynomial…

Combinatorics · Mathematics 2025-10-14 Xiaxia Guan , Xian'an Jin , Weiling Yang

We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…

Combinatorics · Mathematics 2007-05-23 J. -C. Novelli , J. -Y. Thibon

Many important invariants for matroids and polymatroids, such as the Tutte polynomial, the Billera-Jia-Reiner quasi-symmetric function, and the invariant $\mathcal G$ introduced by the first author, are valuative. In this paper we construct…

Combinatorics · Mathematics 2010-08-27 Harm Derksen , Alex Fink

We introduce an arithmetic version of the multivariate Tutte polynomial, and (for representable arithmetic matroids) a quasi-polynomial that interpolates between the two. A generalized Fortuin-Kasteleyn representation with applications to…

Combinatorics · Mathematics 2013-01-17 Petter Brändén , Luca Moci

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

Combinatorics · Mathematics 2012-03-12 Brandon Humpert , Jeremy L. Martin

We study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a \emph{stressed subset}. This framework provides a new combinatorial characterization of the class of split…

Combinatorics · Mathematics 2024-09-12 Luis Ferroni , Benjamin Schröter

We introduce and investigate multivariate Tutte polynomials, dichromatic polynomials, subset-corank polynomials, size-corank polynomials, and rank generating polynomials of semimatroids, which generalize the corresponding polynomial…

Combinatorics · Mathematics 2025-08-04 Houshan Fu

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

The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M, and encodes much important combinatorial information…

Combinatorics · Mathematics 2021-01-01 Alan D. Sokal

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

The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid $N$, we associate…

Combinatorics · Mathematics 2023-10-12 Jordan Awan , Olivier Bernardi

We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant. There are four inclusion-wise maximal families, two of which are…

Combinatorics · Mathematics 2025-02-10 Luis Ferroni , Benjamin Schröter

We define a Hopf algebra of polylogarithms of an arbitrary field, which is a candidate for a conjectural Hopf algebra of framed mixed Tate motives. Our definition is elementary and mimics Goncharov's construction of higher Bloch groups. We…

Number Theory · Mathematics 2025-08-20 Steven Charlton , Andrei Matveiakin , Danylo Radchenko , Daniil Rudenko

We introduce a canonical structure of a commutative associative filtered algebra with the unit on polynomial smooth valuations, and study its properties. The induced structure on the subalgebra of translation invariant smooth valuations has…

Metric Geometry · Mathematics 2021-04-23 Semyon Alesker

The Tutte polynomial is originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning subgraphs, and of…

Combinatorics · Mathematics 2018-12-06 Hery Randriamaro