![]() |
Discrete Mathematics & Theoretical Computer Science |
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants. We then generalize the class of skew Young tableaux under consideration; this allows in particular to discover some presumably new results concerning Eulerian numbers.
Source : ScholeXplorer
IsRelatedTo ARXIV math/0106115 Source : ScholeXplorer IsRelatedTo DOI 10.1016/s0196-8858(02)00537-7 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0106115
|