Permutree sorting

DOI10.5802/alco.249OpenAlexW4321785972MaRDI QIDQ5972262

Daniel Tamayo Jiménez, Vincent Pilaud, Vivane Pons

Publication date: 5 April 2023

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5802/alco.249

zbMATH Keywords

automataweak orderstack sortingpermutrees

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Algebraic combinatorics (05E99)

Cites Work

• Unnamed Item
• Unnamed Item
• Sortable elements and Cambrian lattices.
• Hopf algebra of the planar binary trees
• Cluster algebras. II: Finite type classification
• The weak order on integer posets
• Realization of the Stasheff polytope
• Duality between quasi-symmetric functions and the Solomon descent algebra
• Removahedral congruences versus permutree congruences
• Realizations of the associahedron and cyclohedron
• Cambrian Hopf algebras
• Cambrian lattices.
• Lattice congruences of the weak order.
• Cluster algebras I: Foundations
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Monoïdes préordonnés et chaînes de Malcev
• Permutrees

This page was built for publication: Permutree sorting