Enumerating Permutations and Rim Hooks Characterized by Double Descent Sets

Christopher Zhu

Let $dd(I;n)$ denote the number of permutations of $[n]$ with double descent set $I$. For singleton sets $I$, we present a recursive formula for $dd(I;n)$ and a method to estimate…