Nantel Bergeron ; Thomas Lam ; Huilan Li - Combinatorial Hopf Algebras and Towers of Algebras

dmtcs:3634 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008) - https://doi.org/10.46298/dmtcs.3634
Combinatorial Hopf Algebras and Towers of AlgebrasArticle

Authors: Nantel Bergeron ORCID1; Thomas Lam 2; Huilan Li 3

  • 1 Department of Mathematics and Statistics [Toronto]
  • 2 Department of Mathematics [Cambridge]
  • 3 Laboratoire de combinatoire et d'informatique mathématique [Montréal]

Bergeron and Li have introduced a set of axioms which guarantee that the Grothendieck groups of a tower of algebras $\bigoplus_{n \geq 0}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 \geq 0}A_n$ gives rise to graded dual Hopf algebras then we must have $\dim (A_n)=r^nn!$ where $r = \dim (A_1)$.


Volume: DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008)
Section: Proceedings
Published on: January 1, 2008
Imported on: May 10, 2017
Keywords: graded algebra,Hopf algebra,Grothendieck group,dual graded graph,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Funder: Natural Sciences and Engineering Research Council of Canada
  • FRG: Collaborative Research: Affine Schubert Calculus: Combinatorial, geometric, physical, and computational aspects; Funder: National Science Foundation; Code: 0652641
  • Combinatorics in geometry and representation theory; Funder: National Science Foundation; Code: 0600677

3 Documents citing this article

Consultation statistics

This page has been seen 227 times.
This article's PDF has been downloaded 301 times.