Algebraic and combinatorial structures on Baxter permutations

12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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 of Combinatorial Theory Series A, 110:237-273, 2005]. © 2011 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.

Cite

CITATION STYLE

APA

Giraudo, S. (2011). Algebraic and combinatorial structures on Baxter permutations. In FPSAC’11 - 23rd International Conference on Formal Power Series and Algebraic Combinatorics (pp. 387–398). https://doi.org/10.46298/dmtcs.2919

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free