Abstract
The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval posets of permutations. We present a bijection between tree interval posets and convex polygons with non-crossing diagonals, offering a novel geometric perspective on this purely combinatorial concept. Additionally, we provide an enumeration of interval posets using this bijection and demonstrate its application to block-wise simple permutations.
Original language | English |
---|---|
Pages (from-to) | 35-42 |
Number of pages | 8 |
Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
Volume | 403 |
DOIs | |
State | Published - 24 Jun 2024 |
Externally published | Yes |
Event | 13th Conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, GASCom 2024 - Bordeaux, France Duration: 24 Jun 2024 → 28 Jun 2024 |
Bibliographical note
Publisher Copyright:© E. Bagno, E. Eisenberg, S. Reches and M. Sigron.