Algebraic and combinatorial structures on Baxter permutations

• Published in: Discrete Mathematics & Theoretical Computer Science
• Main Author: Giraudo, Samuele
• Other Authors: Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Bousquet-Mélou, Mireille and Wachs, Michelle and Hultman, Axel
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2011
• Subjects: Hopf algebras; Robinson-Schensted algorithm; quotient monoid; Baxter permutations; [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]; [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]; Baxter; Iceland
• Online Access: https://inria.hal.science/hal-00790742; https://inria.hal.science/hal-00790742v2/document; https://inria.hal.science/hal-00790742v2/file/dmAO0135.pdf; https://doi.org/10.46298/dmtcs.2919

International audience 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 (\emphi.e. Baxter permutations, pairs of twin binary trees, \emphetc.). This construction relie...