scholarly journals Superization and $(q,t)$-Specialization in Combinatorial Hopf Algebras

10.37236/87 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Jean-Yves Thibon
Keyword(s):  
Hopf Algebras ◽  
Symmetric Functions ◽  
Binary Trees ◽  
Hook Length ◽  
Combinatorial Hopf Algebras ◽  
Plane Trees ◽  
Classical Construction

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 Björner-Wachs $q$-hook-length formulas for binary trees, and similar formulas for plane trees.

scholarly journals Lattice of combinatorial Hopf algebras: binary trees with multiplicities

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Jean-Baptiste Priez
Keyword(s):  
Hopf Algebra ◽  
Hopf Algebras ◽  
Lattice Structure ◽  
Binary Trees ◽  
Hook Length ◽  
Combinatorial Hopf Algebras ◽  
Combinatorial Hopf Algebra ◽  
International Audience ◽  
Comme Application ◽  
Premiere Partie

International audience 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 mettons à jour une structure de treillis sur ces algèbres de Hopf combinatoires. Comme application, nous construisons une nouvelle algèbre de Hopf sur des arbres binaires à multiplicités et on l’utilise pour démontrer une formule des équerressur ces arbres.

scholarly journals Antipode Formulas for some Combinatorial Hopf Algebras

10.37236/5949 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Rebecca Patrias
Keyword(s):  
Hopf Algebra ◽  
Hopf Algebras ◽  
Symmetric Functions ◽  
Explicit Formulas ◽  
Quasisymmetric Functions ◽  
Noncommutative Symmetric Functions ◽  
Combinatorial Hopf Algebras ◽  
Combinatorial Formulas ◽  
K Theory

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 analogues of the symmetric functions, quasisymmetric functions, and noncommutative symmetric functions.

scholarly journals Combinatorial Hopf Algebras of Simplicial Complexes

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Carolina Benedetti ◽  
Joshua Hallam ◽  
John Machacek
Keyword(s):  
Hopf Algebra ◽  
Hopf Algebras ◽  
Symmetric Functions ◽  
Simplicial Complexes ◽  
Combinatorial Hopf Algebras ◽  
International Audience ◽  
Donnent Lieu

International audience 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 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. Nous considérons une algèbre de Hopf de complexes simpliciaux et fournissons une formule sans multiplicité pour son antipode. On obtient ensuite une famille d'algèbres de Hopf combinatoires en définissant une famille de caractères sur cette algèbre de Hopf. Les caractères de ces algèbres de Hopf donnent lieu à des fonctions symétriques qui encode de l’information sur les coloriages du complexe simplicial ainsi que son vecteur-$f$. Nousallons également utiliser des caractères pour donner une généralisation du théorème $(-1)$ de Stanley.

scholarly journals Supercharacters, symmetric functions in noncommuting variables (extended abstract)

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Marcelo Aguiar ◽  
Carlos André ◽  
Carolina Benedetti ◽  
Nantel Bergeron ◽  
Zhi Chen ◽  
...  
Keyword(s):  
Hopf Algebra ◽  
Fourier Analysis ◽  
Finite Field ◽  
Hopf Algebras ◽  
Symmetric Functions ◽  
Combinatorial Hopf Algebras ◽  
Nous Montrons ◽  
International Audience

International audience We identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in noncommuting variables. Each is a Hopf algebra and the two are isomorphic as such. This allows developments in each to be transferred. The identification suggests a rich class of examples for the emerging field of combinatorial Hopf algebras. Nous montrons que deux structures en apparence bien différentes peuvent être identifiées: les super-caractères, qui sont un outil commode pour faire de l'analyse de Fourier sur le groupe des matrices unipotentes triangulaires supérieures à coefficients dans un corps fini, et l'anneau des fonctions symétriques en variables non-commutatives. Ces deux structures sont des algèbres de Hopf isomorphes. Cette identification permet de traduire dans une structure les dévelopements conçus pour l'autre, et suggère de nombreux exemples dans le domaine nouveau des algèbres de Hopf combinatoires.

scholarly journals Hook Length Formulas for Trees by Han's Expansion

10.37236/151 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
William Y.C. Chen ◽  
Oliver X.Q. Gao ◽  
Peter L. Guo
Keyword(s):  
Weight Function ◽  
General Formula ◽  
Generating Functions ◽  
Binary Trees ◽  
Hook Length ◽  
Labeled Trees ◽  
Plane Trees

Recently Han obtained a general formula for the weight function corresponding to the expansion of a series in terms of hook lengths of binary trees. In this paper, we present weight function formulas for $k$-ary trees, plane trees, plane forests, labeled trees and forests. We also find appropriate generating functions which lead to unifications of the hook length formulas due to Du and Liu, Han, Gessel and Seo, and Postnikov.

scholarly journals Redfield-Pólya theorem in $\mathrm{WSym}$

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Jean-Paul Bultel ◽  
Ali Chouria ◽  
Jean-Gabriel Luque ◽  
Olivier Mallet
Keyword(s):  
Hopf Algebras ◽  
Symmetric Functions ◽  
Combinatorial Hopf Algebras ◽  
International Audience

International audience We give noncommutative versions of the Redfield-Pólya theorem in $\mathrm{WSym}$, the algebra of word symmetric functions, and in other related combinatorial Hopf algebras. Nous donnons des versions non-commutatives du théorème d’énumération de Redfield-Pólya dans $\mathrm{WSym}$, l’algèbre des fonctions symétriques sur les mots, ainsi que dans d’autres algèbres de Hopf combinatoires.

scholarly journals The # product in combinatorial Hopf algebras

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Jean-Christophe Aval ◽  
Jean-Christophe Novelli ◽  
Jean-Yves Thibon
Keyword(s):  
Associative Algebra ◽  
Hopf Algebras ◽  
Binary Trees ◽  
Free Associative Algebra ◽  
Combinatorial Hopf Algebras ◽  
Nous Montrons ◽  
International Audience

International audience We show that the # product of binary trees introduced by Aval and Viennot (2008) is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras. Nous montrons que le produit # introduit par Aval et Viennot (2008) est défini au niveau de l'algèbre associative libre, et peut être étendu à la plupart des algèbres de Hopf combinatoires classiques.

scholarly journals Linear Compactness and Combinatorial Bialgebras

10.37236/9459 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Eric Marberg
Keyword(s):  
Hopf Algebras ◽  
Symmetric Functions ◽  
Equivalence Classes ◽  
Vector Spaces ◽  
Bounded Degree ◽  
Combinatorial Hopf Algebras ◽  
Infinite Dimensional

We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose equivalence classes generate linearly compact bialgebras under shifted shuffling and deconcatenation. We also extend some of the theory of combinatorial Hopf algebras to bialgebras that are not connected or of finite graded dimension. Finally, we discuss several examples of quasi-symmetric functions, not necessarily of bounded degree, that may be constructed via terminal properties of combinatorial bialgebras.

scholarly journals Dual Creation Operators and a Dendriform Algebra Structure on the Quasisymmetric Functions

2017 ◽  
Vol 69 (1) ◽  
pp. 21-53 ◽  
Author(s):  
Darij Grinberg
Keyword(s):  
Hopf Algebras ◽  
Young Tableau ◽  
Vertex Operators ◽  
Schur Function ◽  
Algebra Structure ◽  
Quasisymmetric Functions ◽  
Combinatorial Hopf Algebras ◽  
Dendriform Algebra ◽  
Natural Analogues ◽  
Creation Operators

AbstractThe dual immaculate functions are a basis of the ring QSym of quasisymmetric functions and form one of the most natural analogues of the Schur functions. The dual immaculate function corresponding to a composition is a weighted generating function for immaculate tableaux in the same way as a Schur function is for semistandard Young tableaux; an immaculate tableau is defined similarly to a semistandard Young tableau, but the shape is a composition rather than a partition, and only the first column is required to strictly increase (whereas the other columns can be arbitrary, but each row has to weakly increase). Dual immaculate functions were introduced by Berg, Bergeron, Saliola, Serrano, and Zabrocki in arXiv:1208.5191, and have since been found to possess numerous nontrivial properties.In this note, we prove a conjecture of M. Zabrocki that provides an alternative construction for the dual immaculate functions in terms of certain “vertex operators”. The proof uses a dendriform structure on the ring QSym; we discuss the relation of this structure to known dendriformstructures on the combinatorial Hopf algebras FQSym andWQSym.

Sign in / Sign up

Export Citation Format

Share Document