Abstract
Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the classical conditions for binary search trees. Similar to binary trees for the Tamari lattice, Cambrian trees provide convenient combinatorial models for N. Reading's Cambrian lattices of type A. Based on a natural surjection from signed permutations to Cambrian trees, we define the Cambrian Hopf algebra extending J.-L. Loday and M. Ronco's algebra on binary trees. We describe combinatorially the products and coproducts of both the Cambrian algebra and its dual in terms of operations on Cambrian trees. We then construct the Baxter–Cambrian algebra which extends S. Law and N. Reading's Baxter Hopf algebra on rectangulations and S. Giraudo's equivalent Hopf algebra on twin binary trees.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
