Regions of the type C Catalan arrangement
Anne Micheli, Vu Nguyen Dinh

TL;DR
This paper establishes a bijection between certain labeled forests and the regions of the type C Catalan arrangement, providing a combinatorial proof of their enumeration formula.
Contribution
It introduces a new bijective proof linking rooted labeled forests with regions of the type C Catalan arrangement, enhancing combinatorial understanding.
Findings
Bijection between labeled forests and arrangement regions
Proof of the enumeration formula for regions
Enhanced combinatorial interpretation of type C Catalan regions
Abstract
In this paper, we give a bijection between rooted labeled ordered forests with a selected subset of their leaves and the regions of the type Catalan arrangement in . We thus obtain a bijective proof of the well-known enumeration formula of these regions .
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 Combinatorial Mathematics · Advanced Mathematical Identities · Algebraic structures and combinatorial models
