Posets of annular non-crossing partitions of types B and D
Alexandru Nica, Ion Oancea

TL;DR
This paper explores the structure of annular non-crossing partitions of types B and D, establishing poset isomorphisms and lattice properties, thereby extending combinatorial understanding of these algebraic objects.
Contribution
It introduces and proves the poset isomorphism between annular non-crossing permutations and partitions of types B and D, including lattice structures for specific cases.
Findings
Poset isomorphism between permutations and partitions of types B and D.
The poset $ cb (p,1)$ is a lattice under reverse refinement.
The poset $ cd (p,1)$ coincides with a known lattice from prior work.
Abstract
We study the set of annular non-crossing permutations of type B, and we introduce a corresponding set of annular non-crossing partitions of type B, where and are two positive integers. We prove that the natural bijection between and is a poset isomorphism, where the partial order on is induced from the hyperoctahedral group , while is partially ordered by reverse refinement. In the case when , we prove that is a lattice with respect to reverse refinement order. We point out that an analogous development can be pursued in type D, where one gets a canonical isomorphism between and . For , the poset coincides with a poset ``'' constructed in a paper by Athanasiadis and Reiner in 2004, and is a lattice by the…
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 · graph theory and CDMA systems · Advanced Mathematical Identities
