Permutree sorting

DOI10.5802/ALCO.249MaRDI QIDQ5972262zbMATH OpenOpenAlexFDO

Authors Vincent Pilaud, Vivane Pons, Daniel Tamayo Jiménez

Publication date 5 April 2023

Published in Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

automatapermutreesstack sortingweak order

Mathematics Subject Classification ID

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

Recommendations

• Permutree sorting
• Sorted and/or sortable permutations
• Sorting and preimages of pattern classes
• A survey of stack-sorting disciplines
• A survey of stack sortable permutations

Cites work

• Cambrian Hopf algebras
• Cambrian lattices.
• Cluster algebras. I: Foundations
• Cluster algebras. II: Finite type classification
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Duality between quasi-symmetric functions and the Solomon descent algebra
• Hopf algebra of the planar binary trees
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Lattice congruences of the weak order.
• Monoïdes préordonnés et chaînes de Malcev
• Permutrees
• Realization of the Stasheff polytope
• Realizations of the associahedron and cyclohedron
• Removahedral congruences versus permutree congruences
• Sortable elements and Cambrian lattices.
• The weak order on integer posets

Cited in

(2)

• How to sort by walking and swapping on paths and trees
• Making bubblesort recursive

This page was built for publication: Permutree sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5972262)