Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2010
Springer

favoriteEmaildiscussreport

69views Education» more CORR 2010»

On the enumeration of d-minimal permutations

13 years 2 months ago

On the enumeration of d-minimal permutations

Download hal.archives-ouvertes.fr

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.

Mathilde Bouvel, Luca Ferrari

Real-time Traffic

CORR 2010 | Education | Eulerian Numbers | Minimal Permutations | Skew Young Tableaux |

claim paper

Related Content

» Enumeration Schemes for Restricted Permutations

» Corrigendum to enumerating permutation polynomials I Permutations with nonmaximal degree ...

» Enumeration by kernel positions for strongly Bernoulli type truncation games on words

» Enumerating permutation polynomials over finite fields by degree II

» Restricted Dumont permutations Dyck paths and noncrossing partitions

» Multistatistic enumeration of twostack sortable permutations

» A bijection between permutations and floorplans and its applications

» Implicit permutation enumeration networks and binary decision diagrams reordering

» Permutation statistics on involutions

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Mathilde Bouvel, Luca Ferrari

Comments (0)