Related papers: Hopf algebras and Tutte polynomials

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…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

We consider the Hopf algebra of B-diagrams as an algebra projecting onto the Heisenberg algebra and designed to encode the combinatorics of the bosonic normal-ordering problem. In order to understand and generalize the properties of the…

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

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…

This tutorial is intended to give an accessible introduction to Hopf algebras. The mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and quantum physics,…

We study Hopf Galois extensions of Hopf algebroids as a generalization of the theory for Hopf algebras. More precisely, we introduce (skew-)regular comodules and generalize the structure theorem for relative Hopf modules. Also, we show that…

In this paper, we find recursive formulas for the Tutte polynomial of a family of small-world networks: Farey graphs, which are modular and have an exponential degree hierarchy. Then, making use of these formulas, we determine the number of…

This is a study on pattern Hopf algebras in combinatorial structures. We introduce the notion of combinatorial presheaf, by adapting the algebraic framework of species to the study of substructures in combinatorics. Afterwards, we consider…

Cut-and-paste $K$-theory is a new variant of higher algebraic $K$-theory that has proven to be useful in problems involving decompositions of combinatorial and geometric objects, e.g., scissors congruence of polyhedra and reconstruction…

We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial,…

Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…

We consider three a priori totally different setups for Hopf algebras from number theory, mathematical physics and algebraic topology. These are the Hopf algebra of Goncharov for multiple zeta values, that of Connes-Kreimer for…

We generalise gauge theory on a graph so that the gauge group becomes a finite-dimensional ribbon Hopf algebra, the graph becomes a ribbon graph, and gauge-theoretic concepts such as connections, gauge transformations and observables are…

For a given finite dimensional Hopf algebra $H$ we describe the set of all equivalence classes of cocycle deformations of $H$ as an affine variety, using methods of geometric invariant theory. We show how our results specialize to the…

We define 2-decompositions of ribbon graphs, which generalise 2-sums and tensor products of graphs. We give formulae for the Bollobas-Riordan polynomial of such a 2-decomposition, and derive the classical Brylawski formula for the Tutte…

A common generalization for the chromatic polynomial and the flow polynomial of a graph $G$ is the Tutte polynomial $T(G;x,y)$. The combinatorial meaning for the coefficients of $T$ was discovered by Tutte at the beginning of its…

Let $G$ be a matrix and $M(G)$ be the matroid defined by linear dependence on the set $E$ of column vectors of $G.$ Roughly speaking, a parcel is a subset of pairs $(f,g)$ of functions defined on $E$ to an Abelian group $A$ satisfying a…

The tensor product $(G_1,G_2)$ of a graph $G_1$ and a pointed graph $G_2$ (containing one distinguished edge) is obtained by identifying each edge of $G_1$ with the distinguished edge of a separate copy of $G_2$, and then removing the…

We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that…