We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general construction based on graphs, and its non-commutative dual is realized in three different ways, in particular as the Grossman-Larson algebra of heap ordered trees.
Extensions to endofunctions, parking functions, set compositions, set partitions, planar binary trees and rooted forests are discussed. Finally, we introduce one-parameter families interpolating between different structures constructed on the same combinatorial objects.
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general construction based on graphs, and its non-commutative dual is realized in three different ways, in particular as the Grossman-Larson algebra of heap ordered trees. Extensions to endofunctions, parking functions, set partitions, planar binary trees and rooted forests are discussed. Finally, we introduce one-parameter families interpolating between different structu…
There is a very natural and well-behaved Hopf algebra morphism from quasisymmetric functions to peak algebra, which we call it Theta map. This paper focuses on generalizing the peak algebra by constructing generalized Theta maps for an arbitrary combinatorial Hopf algebra. The image of Theta maps lies in the odd Hopf subalgebras, so we present a strategy to find odd Hopf subalgebra of any combinatorial Hopf algebra. We also give a combinatorial description of a family of Theta maps for Malvenuto-Reutenauer Hopf algebra of permutations $\operatorname{\mathsf{\mathfrak{S}Sym}}$ whose images are …
We show that the # product of binary trees introduced by Aval and Viennot [arXiv:0912.0798] is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.
In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an application, we construct a new combinatorial Hopf algebra on binary trees with multiplicities and use it to prove a hook length formula for those trees. Dans une première partie, nous formalisons la construction d'algèbres de Hopf combinatoires à partir d'une réalisation polynomiale et de monoïdes de type monoïde plaxique. Grâce à cette construction, nous metto…
We introduce dual Hopf algebras which simultaneously combine the concepts of the k-Schur function theory with the quasi-symmetric Schur function theory. We construct dual basis of these Hopf algebras with remarkable properties.
We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests isomorphic to the Hopf algebra of parking functions, and to a new noncommutative algebra based on endofunctions admitting many interesting subalgebras and quotients.
We investigate quasisymmetric functions coming from combinatorial Hopf monoids. We show that these invariants arise naturally in Ehrhart theory, and that some of their specializations are Hilbert functions for relative simplicial complexes. This class of complexes, called forbidden composition complexes, also forms a Hopf monoid, thus demonstrating a link between Hopf algebras, Ehrhart theory, and commutative algebra. We also study various specializations of quasisymmetric functions.
Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, Lam and Pylyavskyy studied six combinatorial Hopf algebras that can be thought of as K-theoretic analogues of the Hopf algebras of symmetric functions, quasisymmetric functions, noncommutative symmetric functions, and of the Malvenuto-Reutenauer Hopf algebra of permutations. They described the bialgebra structure in all cases that were not yet known but left open the question of finding explicit formulas for the antipode maps. We give combinatorial formulas for the antipode map for the K-theoretic…
Partial multivariate Bell polynomials have been defined by E.T. Bell in 1934. These polynomials have numerous applications in Combinatorics, Analysis, Algebra, Probabilities, etc. Many of the formulae on Bell polynomials involve combinatorial objects (set partitions, set partitions in lists, permutations, etc.). So it seems natural to investigate analogous formulae in some combinatorial Hopf algebras with bases indexed by these objects. The algebra of symmetric functions is the most famous example of a combinatorial Hopf algebra. In a first time, we show that most of the results on Bell polyno…
A general lattice theoretic construction of Reading constructs Hopf subalgebras of the Malvenuto-Reutenauer Hopf algebra (MR) of permutations. The products and coproducts of these Hopf subalgebras are defined extrinsically in terms of the embedding in MR. The goal of this paper is to find an intrinsic combinatorial description of a particular one of these Hopf subalgebras. This Hopf algebra has a natural basis given by permutations that we call Pell permutations. The Pell permutations are in bijection with combinatorial objects that we call sashes, that is, tilings of a 1 by n rectangle with t…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in power series rings. When analyzed in terms of combinatorial Hopf algebras, the simplest examples yield interesting algebraic identities or enumerative results.
We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combinatorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial complexes and their $f$-vectors. We also use characters to give a generalization of Stanley's $(-1)$-color theorem. A $q$-analog version of this family of characters is also studied.
The Connes-Kreimer Hopf algebra of rooted trees, its dual, and the Foissy Hopf algebra of of planar rooted trees are related to each other and to the well-known Hopf algebras of symmetric and quasi-symmetric functions via a pair of commutative diagrams. We show how this point of view can simplify computations in the Connes-Kreimer Hopf algebra and its dual, particularly for combinatorial Dyson-Schwinger equations.
We generalize Bruned et.al.'s notion of translation in geometric and branched rough paths to a notion of translation in rough paths over any combinatorial Hopf algebra. We show that this notion of translation is equivalent to two bialgebras being in cointeraction, subject to certain additional conditions. We argue that reformulating translations in terms of substitutions, provides simpler conditions for the cointeraction formulation. For the special case where the translation can be obtained from a product, we show how to obtain a description of the dual coaction. As a concrete example, we des…
We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the quasisymmetric function invariants associated to the combinatorial Hopf monoid. We show that the collection of all such coloring complexes forms a linearized combinatorial Hopf monoid, which is the terminal object in the category of combinatorial Hopf monoids with convex characters. We also study several examples of combinatorial Hopf monoids.
We uncover the structure of the space of symmetric functions in non-commutative variables by showing that the underlined Hopf algebra is both free and co-free. We also introduce the Hopf algebra of quasi-symmetric functions in non-commutative variables and define the product and coproduct on the monomial basis of this space and show that this Hopf algebra is free and cofree. In the process of looking for bases which generate the space we define orders on the set partitions and set compositions which allow us to define bases which have simple and natural rules for the product of basis elements.
A non-commutative, planar, Hopf algebra of rooted trees was proposed in L. Foissy, Bull. Sci. Math. 126 (2002) 193-239. In this paper we propose such a non-commutative Hopf algebra for graphs. In order to define a non-commutative product we use a quantum field theoretical (QFT) idea, namely the one of introducing discrete scales on each edge of the graph (which, within the QFT framework, corresponds to energy scales of the associated propagators).
We describe a method for constructing characters of combinatorial Hopf algebras by means of integrals over certain polyhedral cones. This is based on ideas from resurgence theory, in particular on the construction of well-behaved averages induced by diffusion processes on the real line. We give several interpretations and proofs of the main result in terms of noncommutative symmetric and quasisymmetric functions, as well as generalizations involving matrix quasi-symmetric functions. The interpretation of noncommutative symmetric functions as alien operators in resurgence theory is also discuss…
We give a new construction of a Hopf subalgebra of the Hopf algebra of Free quasi-symmetric functions whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e. Baxter permutations, pairs of twin binary trees, etc.). This construction relies on the definition of the Baxter monoid, analog of the plactic monoid and the sylvester monoid, and on a Robinson-Schensted-like insertion algorithm. The algebraic properties of this Hopf algebra are studied. This Hopf algebra appeared for the first time in the work of Reading [Lattice congruences, fans and Hopf algebras, Journal …
We construct a new bigraded Hopf algebra whose bases are indexed by square matrices with entries in the alphabet $\{0, 1, ..., k\}$, $k \geq 1$, without null rows or columns. This Hopf algebra generalizes the one of permutations of Malvenuto and Reutenauer, the one of $k$-colored permutations of Novelli and Thibon, and the one of uniform block permutations of Aguiar and Orellana. We study the algebraic structure of our Hopf algebra and show, by exhibiting multiplicative bases, that it is free. We moreover show that it is self-dual and admits a bidendriform bialgebra structure. Besides, as a Ho…
A universal framework for Hopf algebras in combinatorics
Research Center for Mathematics and Interdisciplinary Sciences, Shandong University（山东大学数学与交叉科学研究院）；Frontiers Science Center for Nonlinear Expectations, Ministry of Education（教育部非线性期望前沿科学中心）；Department of Mathematics, University of British Columbia（不列颠哥伦比亚大学数学系）
Many families of combinatorial objects have a Hopf monoid structure. Aguiar and Ardila introduced the Hopf monoid of generalized permutahedra and showed that it contains various other notable combinatorial families as Hopf submonoids, including graphs, posets, and matroids. We introduce the Hopf monoid of orbit polytopes, which is generated by the generalized permutahedra that are invariant under the action of the symmetric group. We show that modulo normal equivalence, these polytopes are in bijection with integer compositions. We interpret the Hopf structure through this lens, and we show th…
We introduce a new family of noncommutative analogues of the Hall-Littlewood symmetric functions. Our construction relies upon Tevlin's bases and simple q-deformations of the classical combinatorial Hopf algebras. We connect our new Hall-Littlewood functions to permutation tableaux, and also give an exact formula for the q-enumeration of permutation tableaux of a fixed shape. This gives an explicit formula for: the steady state probability of each state in the partially asymmetric exclusion process (PASEP); the polynomial enumerating permutations with a fixed set of weak excedances according t…
We study the chromatic quasisymmetric class function of a linearized combinatorial Hopf monoid. Given a linearized combinatorial Hopf monoid $H$, and an $H$-structure $h$ on a set $N$, there are proper colorings of $h$, generalizing graph colorings and poset partitions. We show that the automorphism group of $h$ acts on the set of proper colorings. The chromatic quasisymmetric class function enumerates the fixed points of this action, weighting each coloring with a monomial. For the Hopf monoid of graphs this invariant generalizes Stanley's chromatic symmetric function and specializes to the o…
The permutation pattern Hopf algebra is a commutative filtered and connected Hopf algebra. Its product structure stems from counting patterns of a permutation, interpreting the coefficients as permutation quasi-shuffles. The Hopf algebra was shown to be a free commutative algebra and to fit into a general framework of pattern Hopf algebras, via species with restrictions. In this paper we introduce the cancellation-free and grouping-free formula for the antipode of the permutation pattern Hopf algebra. To obtain this formula, we use the popular sign-reversing involution method, by Benedetti and…
We extend to several combinatorial Hopf algebras the endomorphism of symmetric functions sending the first power-sum to zero and leaving the other ones invariant. As a transformation of alphabets, this is the (1-E)-transform, where E is the exponential alphabet, whose elementary symmetric functions are e_n=1/n!. In the case of noncommutative symmetric functions, we recover Schocker's idempotents for derangement numbers [Discr. Math. 269 (2003), 239]. From these idempotents, we construct subalgebras of the descent algebras analogous to the peak algebras and study their representation theory. Th…
We briefly review the rôle played by algebraic structures like combinatorial Hopf algebras in the renormalizability of (noncommutative) quantum field theory. After sketching the commutative case, we analyze the noncommutative Grosse-Wulkenhaar model.
We construct Hopf algebras whose elements are representations of combinatorial automorphism groups, by generalising a theorem of Zelevinsky on Hopf algebras of representations of wreath products. As an application we attach symmetric functions to representations of graph automorphism groups, generalising and refining Stanley's chromatic symmetric function.
Loday and Ronco defined an interesting Hopf algebra structure on the linear span of the set of planar binary trees. They showed that the inclusion of the Hopf algebra of non-commutative symmetric functions in the Malvenuto-Reutenauer Hopf algebra of permutations factors through their Hopf algebra of trees, and these maps correspond to natural maps from the weak order on the symmetric group to the Tamari order on planar binary trees to the boolean algebra. We further study the structure of this Hopf algebra of trees using a new basis for it. We describe the product, coproduct, and antipode in t…
Recent work on perturbative quantum field theory has led to much study of the Connes-Kreimer Hopf algebra. Its (graded) dual, the Grossman-Larson Hopf algebra of rooted trees, had already been studied by algebraists. L. Foissy introduced a noncommutative version of the Connes-Kreimer Hopf algebra, which turns out to be self-dual. Using some homomorphisms defined by the author and W. Zhao, we describe a commutative diagram that relates the aforementioned Hopf algebras to each other and to the Hopf algebras of symmetric functions, noncommutative symmetric functions, and quasi-symmetric functions…
We define two coproducts for cycle-free oriented graphs, thus building up two commutative con- nected graded Hopf algebras, such that one is a comodule-coalgebra on the other, thus generalizing the result obtained previously for Hopf algebras of rooted trees.
In 2017 Aguiar and Ardila provided a generic way to construct polynomial invariants of combinatorial objects using the notions of Hopf monoids and characters of Hopf monoids. They show that it is possible to find a combinatorial interpretation of these polynomials over negative integers using the antipode and give a cancellation-free grouping-free formula for the antipode on generalized permutahedra. In this work, we give a combinatorial interpretation of these polynomials over both positive integers and negative integers for the Hopf monoids of generalized permutahedra and hypergraphs and for…
We develop a theory of multigraded (i.e., $N^l$-graded) combinatorial Hopf algebras modeled on the theory of graded combinatorial Hopf algebras developed by Aguiar, Bergeron, and Sottile [Compos. Math. 142 (2006), 1--30]. In particular we introduce the notion of canonical $k$-odd and $k$-even subalgebras associated with any multigraded combinatorial Hopf algebra, extending simultaneously the work of Aguiar et al. and Ehrenborg. Among our results are specific categorical results for higher level quasisymmetric functions, several basis change formulas, and a generalization of the descents-to-pea…
We suggest the point of view that the Schubert classes of the affine Grassmannian of a simple algebraic group should be considered as Schur-positive symmetric functions. In particular, we give a geometric explanation of the Schur positivity of k-Schur functions (at t = 1). We also put this in the context of the theory of combinatorial Hopf algebras.
In this work a combinatorial description is provided of a Faa di Bruno type Hopf algebra which naturally appears in the context of Fliess operators in nonlinear feedback control theory. It is a connected graded commutative and non-cocommutative Hopf algebra defined on rooted circle trees. A cancellation free forest formula for its antipode is given.
Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, we study six combinatorial Hopf algebras. These Hopf algebras can be thought of as K-theoretic analogues of the by now classical ``square'' of Hopf algebras consisting of symmetric functions, quasisymmetric functions, noncommutative symmetric functions and the Malvenuto-Reutenauer Hopf algebra of permutations. In addition, we develop a theory of set-valued P-partitions and study three new families of symmetric functions which are weight generating functions of reverse plane partitions, weak set-va…
We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the dendriform structures yields in particular (q,t)-analogs of the Bjorner-Wachs q-hook-length formulas for binary trees, and similar formulas for plane trees.
We generalize the Hopf algebras of free quasisymmetric functions, quasisymmetric functions, noncommutative symmetric functions, and symmetric functions to certain representations of the category of all finite Coxeter systems and its dual category. We investigate their connections with the representation theory of 0-Hecke algebras of finite Coxeter systems. Restricted to type B and D we obtain dual graded modules and comodules over the corresponding Hopf algebras in type A.
We introduce partial $r$-Bell polynomials in three combinatorial Hopf algebras. We prove a factorization formula for the generating functions which is a consequence of the Zassenhauss formula.
Generalized permutahedra are a family of polytopes with a rich combinatorial structure and strong connections to optimization. We prove that they are the universal family of polyhedra with a certain Hopf algebraic structure. Their antipode is remarkably simple: the antipode of a polytope is the alternating sum of its faces. Our construction provides a unifying framework to organize numerous combinatorial structures, including graphs, matroids, posets, set partitions, linear graphs, hypergraphs, simplicial complexes, building sets, and simple graphs. We highlight three applications: 1. We obtai…
We introduce a general construction that takes as input a so-called stiff PRO and that outputs a Hopf algebra. Stiff PROs are particular PROs that can be described by generators and relations with precise conditions. Our construction generalizes the classical construction from operads to Hopf algebras of van der Laan. We study some of its properties and review some examples of application. We get in particular Hopf algebras on heaps of pieces and retrieve some deformed versions of the noncommutative Faà di Bruno algebra introduced by Foissy.
We provide a Hopf algebra structure on the space of superclass functions on the unipotent upper triangular group of type D over a finite field based on a supercharacter theory constructed by André and Neto. Also, we make further comments with respect to types B and C. Type A was explores by M. Aguiar et. al (2010), thus this paper is a contribution to understand combinatorially the supercharacter theory of the other classical Lie types.
We define in this paper several Hopf algebras describing the combinatorics of the so-called multi-scale renormalization in quantum field theory. After a brief recall of the main mathematical features of multi-scale renormalization, we define assigned graphs, that are graphs with appropriate decorations for the multi-scale framework. We then define Hopf algebras on these assigned graphs and on the Gallavotti-Nicolò trees, particular class of trees encoding the supplementary informations of the assigned graphs. Several morphisms between these combinatorial Hopf algebras and the Connes-Kreimer al…
A combinatorial Hopf algebra is a graded connected Hopf algebra over a field $F$ equipped with a character (multiplicative linear functional) $ζ:H\to F$. We show that the terminal object in the category of combinatorial Hopf algebras is the algebra $QSym$ of quasi-symmetric functions; this explains the ubiquity of quasi-symmetric functions as generating functions in combinatorics. We illustrate this with several examples. We prove that every character decomposes uniquely as a product of an even character and an odd character. Correspondingly, every combinatorial Hopf algebra $(H,ζ)$ possesses …
We introduce a coloured generalization $\mathrm{NSym}_A$ of the Hopf algebra of non-commutative symmetric functions described as a subalgebra of the of rooted ordered coloured trees Hopf algebra. Its natural basis can be identified with the set of sentences over alphabet $A$ (the set of colours). We present also its graded dual algebra $\mathrm{QSym}_A$ of coloured quasi-symmetric functions together with its realization in terms of power series in partially commutative variables. We provide formulas expressing multiplication, comultiplication and the antipode for these Hopf algebras in various…
We give a new construction of a Hopf algebra defined first by Reading whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e., Baxter permutations, pairs of twin binary trees, etc.). Our construction relies on the definition of the Baxter monoid, analog of the plactic monoid and the sylvester monoid, and on a Robinson-Schensted-like correspondence and insertion algorithm. Indeed, the Baxter monoid leads to the definition of a lattice structure over pairs of twin binary trees and the definition of a Hopf algebra. The algebraic properties of this Hopf algebra are st…
We apply down operators in the affine nilCoxeter algebra to yield explicit combinatorial expansions for certain families of non-commutative k-Schur functions. This yields a combinatorial interpretation for a new family of k-Littlewood-Richardson coefficients.
We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.
We introduce a family of periods of mixed Tate motives called dissection polylogarithms, that are indexed by combinatorial objects called dissection diagrams. The motivic coproduct on the former is encoded by a combinatorial Hopf algebra structure on the latter. This generalizes Goncharov's formula for the motivic coproduct on (generic) iterated integrals. Our main tool is the study of the relative cohomology group corresponding to a bi-arrangement of hyperplanes.
Recently, Diaconis, Ram and I created Markov chains out of the coproduct-then-product operator on combinatorial Hopf algebras. These chains model the breaking and recombining of combinatorial objects. Our motivating example was the riffle-shuffling of a deck of cards, for which this Hopf algebra connection allowed explicit computation of all the eigenfunctions. The present note replaces in this construction the coproduct-then-product map with convolutions of projections to the graded subspaces, effectively allowing us to dictate the distribution of sizes of the pieces in the breaking step of t…
A detailed expose of the Hopf algebra approach to interconnected input-output systems in nonlinear control theory is presented. The focus is on input-output systems that can been represented in terms of Chen-Fliess functional expansions or Fliess operators. This provides a starting point for a discrete-time version of this theory. In particular, the notion of a discrete-time Fliess operator is given and a class of parallel interconnections is described.
Bergeron and Li have introduced a set of axioms which guarantee that the Grothendieck groups of a tower of algebras $\bigoplus_{n\ge0}A_n$ can be endowed with the structure of graded dual Hopf algebras. Hivert and Nzeutzhap, and independently Lam and Shimozono constructed dual graded graphs from primitive elements in Hopf algebras. In this paper we apply the composition of these constructions to towers of algebras. We show that if a tower $\bigoplus_{n\ge0}A_n$ gives rise to graded dual Hopf algebras then we must have $\dim(A_n)=r^nn!$ where $r = \dim(A_1)$.
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, showing that in this latter case the axioms of Hopf algebra arise naturally. The text contains many exercises, some taken from physics, aimed at expanding and exemplifying the concepts introduced.
