Mathilde Bouvel ; Luca Ferrari - On the enumeration of d-minimal permutations

dmtcs:636 - Discrete Mathematics & Theoretical Computer Science, April 7, 2013, Vol. 15 no. 2 - https://doi.org/10.46298/dmtcs.636
On the enumeration of d-minimal permutationsArticle

Authors: Mathilde Bouvel ; Luca Ferrari ORCID

    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.


    Volume: Vol. 15 no. 2
    Published on: April 7, 2013
    Accepted on: June 9, 2015
    Submitted on: May 23, 2011
    Keywords: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    Consultation statistics

    This page has been seen 273 times.
    This article's PDF has been downloaded 405 times.