DM Meeting Room, building VII
Â
Abstract:
The (left) stalactic monoid was introduced by Hivert, Novelli and Thibon [6] as the analogue of the plactic monoid for Hopf algebras of word symmetric functions, whose associated combinatorial objects are stalactic tableaux. The (right) taiga monoid was defined by Priez [7] as the quotient of the free monoid over an ordered alphabet by the join of the sylvester [5] and (right) stalactic congruences. Its associated combinatorial objects are binary search trees with multiplicities, for which a RobinsonâSchensted-like correspondence and `hook-length'-like formula are given. The equational theories of these monoids have been studied in [2,4], where they were shown to generate the same variety.
In this talk, we show results on the four plactic-like monoids that arise by taking the meets and joins of stalactic and taiga congruences, following the construction of the Baxter monoid given by Giraudo [3]. We obtain the combinatorial objects associated with the meet monoids, establishing RobinsonâSchensted-like correspondences and giving extraction and iterative insertion algorithms for these objects. We then obtain results on the sizes of classes of words equal in plactic-like monoids, show that some of these monoids are syntactic, and characterise their equational theories. This is joint work with Thomas Aird (University of Manchester), avaliable as a preprint in [1].
References:
[1] T. Aird and D. Ribeiro. Plactic-like monoids arising from meets and joins of stalactic and taiga congruences, 2023. arXiv: 2309.10184.
[2] A.J. Cain, M. Johnson, M. Kambites, and A. Malheiro. Representations and identities of plactic-like monoids. J. Algebra, 606:819â850, 2022.
[3] S. Giraudo. Algebraic and combinatorial structures on pairs of twin binary trees. J. Algebra, 360:115â157, 2012.
[4] B.B. Han and W.T. Zhang. Finite basis problems for stalactic, taiga, sylvester and baxter monoids. Journal of Algebra and Its Applications, 22(10):2350204 (13 pages), 2023.
[5] F. Hivert, J.-C. Novelli, and J.-Y. Thibon. The algebra of binary search trees. Theoret. Comput. Sci., 339(1):129â165, 2005.
[6] F. Hivert, J.-C. Novelli, and J.-Y. Thibon. Commutative combinatorial Hopf algebras. J. Algebr. Comb., 28(1):65â95, 2008.
[7] J.-B. Priez. Lattice of combinatorial Hopf algebras: binary trees with multiplicities. In A. Goupil and G. Schaeffer, editors, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), volume AS of DMTCS Proceedings, pages 1137â1148, Paris, France, 2013.