Enumerating Permutations and Rim Hooks Characterized by Double Descent Sets

Abstract

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 $dd(I;n)$. We also discuss the enumeration of certain classes of rim hooks. Let ${\mathcal{R}}_I(n)$ denote the set of all rim hooks of length $n$ with double descent set $I$, so that any tableau of one of these rim hooks corresponds to a permutation with double descent set $I$. We present a formula for the size of ${\mathcal{R}}_I(n)$ when $I$ is a singleton set, and we also present a formula for the size of ${\mathcal{R}}_I(n)$ when $I$ is the empty set. We additionally present several conjectures about the asymptotics of certain ratios of $dd(I;n)$.

16 pages, 4 figures

References in corpus (1)

• Hook formulas for skew shapes I. $q$-analogues and bijections