Ordered forests and parking functions
Lo\"ic Foissy (LM-Reims)
TL;DR
This paper establishes an isomorphism between the Hopf algebra of parking functions and that of ordered forests, using a rigidity theorem for specific bialgebras.
Contribution
It demonstrates a novel isomorphism between two important combinatorial Hopf algebras through a rigidity theorem.
Findings
Proves the isomorphism between parking functions and ordered forests Hopf algebras
Uses a rigidity theorem to establish algebraic equivalence
Provides new insights into the structure of these combinatorial objects
Abstract
We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Commutative Algebra and Its Applications · Algebraic structures and combinatorial models