English
Related papers

Related papers: Hopf algebras and Tutte polynomials

200 papers

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

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

In this paper we unify two families of topological Tutte polynomials. The first family is that coming from the surface Tutte polynomial, a polynomial that arises in the theory of local flows and tensions. The second family arises from the…

Combinatorics · Mathematics 2024-01-26 Iain Moffatt , Maya Thompson

We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…

Combinatorics · Mathematics 2023-01-02 Stephen Huggett , Iain Moffatt

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 give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…

Combinatorics · Mathematics 2024-08-12 Joanna A. Ellis-Monaghan , Iain Moffatt , Steven Noble

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

In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new…

Combinatorics · Mathematics 2017-04-24 Spencer Backman , Matthias Lenz

In this paper we give a new proof of the universality of the Tutte polynomial for matroids. This proof uses appropriate characters of Hopf algebra of matroids, algebra introduced by Schmitt (1994). We show that these Hopf algebra characters…

Combinatorics · Mathematics 2013-10-22 G. H. E. Duchamp , N. Hoang-Nghia , T. Krajewski , A. Tanasa

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

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

The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the Tutte polynomial from graphs to hypergraphs, and more generally from matroids to polymatroids, as a two-variable polynomial. Our definition is…

Combinatorics · Mathematics 2020-07-23 Olivier Bernardi , Tamas Kalman , Alex Postnikov

We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…

Combinatorics · Mathematics 2020-11-11 Miodrag Iovanov , Jaiung Jun

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

This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…

Combinatorics · Mathematics 2008-07-01 Joanna Ellis-Monaghan , Criel Merino

We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag varieties. We introduce two different generalizations, and demonstrate that each has its own merits, where the trade-off is between the ease…

Combinatorics · Mathematics 2021-01-19 Rodica Dinu , Christopher Eur , Tim Seynnaeve

The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…

Combinatorics · Mathematics 2016-04-19 Nikolai V. Ivanov

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…

Combinatorics · Mathematics 2019-07-05 Lisa Berry , Stefan Forcey , Maria Ronco , Patrick Showers
‹ Prev 1 2 3 10 Next ›