The Hopf algebra of diagonal rectangulations.

DOI10.1016/j.jcta.2011.09.006zbMath1246.16027arXiv1011.2118OpenAlexW2106429008WikidataQ57432201 ScholiaQ57432201MaRDI QIDQ662043

Shirley Law, Nathan Reading

Publication date: 11 February 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.2118

zbMATH Keywords

combinatorial Hopf algebrasBaxter permutationsdiagonal rectangulationsshifted shuffles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Hopf algebras and their applications (16T05) Connections of Hopf algebras with combinatorics (16T30)

Related Items

Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube ⋮ Hopf algebras on decorated noncrossing arc diagrams ⋮ Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ On some combinatorial sequences associated to invariant theory ⋮ Cambrian Hopf algebras ⋮ Lattice homomorphisms between weak orders ⋮ Brick polytopes, lattice quotients, and Hopf algebras ⋮ Generic rectangulations ⋮ An upper bound for the number of rectangulations of a planar point set ⋮ Celebrating Loday's associahedron ⋮ Inequalities associated with the Baxter numbers ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ Unnamed Item ⋮ Coxeter-bicatalan combinatorics ⋮ From the Tamari Lattice to Cambrian Lattices and Beyond ⋮ Unnamed Item ⋮ Algebraic and combinatorial structures on pairs of twin binary trees ⋮ Subclasses of Baxter Permutations Based on Pattern Avoidance ⋮ Poset edge densities, nearly reduced words, and barely set-valued tableaux ⋮ Quotientopes ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ Polytopal realizations and Hopf algebra structures for lattice quotients of the weak order ⋮ Baxter posets ⋮ Noncrossing Arc Diagrams and Canonical Join Representations ⋮ Combinatorial generation via permutation languages. I. Fundamentals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice congruences, fans and Hopf algebras.
• The algebra of binary search trees
• Structure of the Malvenuto-Reutenauer Hopf algebra of permutations
• The number of Baxter permutations
• Hopf algebra of the planar binary trees
• Comparison of Hopf algebras on trees.
• On some properties of the algebra of binary trees
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Generalized permutation patterns and a classification of the Mahonian statistics
• The Hopf algebras of decorated rooted trees. I
• Order structure on the algebra of permutations and of planar binary trees
• Noncommutative symmetric functions
• The patterns of permutations
• Duality between quasi-symmetric functions and the Solomon descent algebra
• Stack words, standard tableaux and Baxter permutations
• Generating trees and forbidden subsequences
• Structure of the Loday-Ronco Hopf algebra of trees.
• Realizations of the associahedron and cyclohedron
• Bijections for Baxter families and related objects
• A bijection between permutations and floorplans, and its applications
• On the number of rectangulations of a planar point set
• Cambrian lattices.
• On the structure of Hopf algebras
• Lattice congruences of the weak order.
• Algebraic and combinatorial structures on Baxter permutations
• Lectures on Polytopes
• Iterated fiber polytopes
• Shellable nonpure complexes and posets. II
• On Fixed Points of the Composite of Commuting Functions