The interval posets of permutations seen from the decomposition tree perspective
From MaRDI portal
Publication:6380776
arXiv2110.10000MaRDI QIDQ6380776FDOQ6380776
Authors: Mathilde Bouvel, Lapo Cioni, Benjamin Izart 
Publication date: 19 October 2021
Abstract: The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the decomposition trees of permutations, describing a procedure to obtain the former from the latter. We then give alternative proofs of some of the results in [B. Tenner, arXiv:2007.06142], and we solve the open problems that it posed (and some other enumerative problems) using techniques from symbolic and analytic combinatorics. Finally, we compute the M"obius function on such posets.
This page was built for publication: The interval posets of permutations seen from the decomposition tree perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380776)
