Pinnacle sets revisited

From MaRDI portal



Abstract: In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute pn(S), the number of permutations of Sn with pinnacle set S, and a conjectural closed formula for the related numbers qn(S). We determine the lexicographically minimal elements of the orbits of the modified Foata-Strehl action, prove that these elements form a lower ideal of the left weak order and characterize and count the maximal elements of this ideal.












This page was built for publication: Pinnacle sets revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197699)