Blockwise simple permutations

Authors Eli Bagno, Estrella Eisenberg, Shulamit Reches, Moriah Sigron

Publication date 23 March 2023

Abstract: A permutation is called {it {block-wise simple}} if it contains no interval of the form

p_{1} o p l u s p_{2}

or

p_{1} o m i n u s p_{2}

. We present this new set of permutations and explore some of its combinatorial properties. We present a generating function for this set, as well as a recursive formula for counting block-wise simple permutations. Following Tenner, who founded the notion of interval posets, we characterize and count the interval posets corresponding to block-wise simple permutations. We also present a bijection between these interval posets and certain tiling's of the

n

-gon. Finally, we prove that the bi-variate distribution of the descent and inverse descent numbers are gamma-positive, provided the correctness of our recent conjecture on simple permutations.

This page was built for publication: Blockwise simple permutations

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