Derangements with Ascending and Descending Blocks
classification
🧮 math.CO
keywords
blocksderangementsworkascendascendingcombinatorialdescenddescending
read the original abstract
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we obtain a generating function for the derangements that ascend in blocks of prescribed lengths, thus solving a problem posed in [3]. We also work towards a combinatorial interpretation of a polynomial sum appearing in [3]. As a result, we obtain a new combinatorial sum for counting derangements with ascending and descending blocks.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.