 |
 |
|
|
| HAL: hal-00530158, version 1 |
| arXiv: 1010.5963 |
| Detailed view |  Export this paper |
 |
|
|
| On the enumeration of d-minimal permutations |
|
|
| Mathilde Bouvel 1Luca Ferrari 2 |
|
|
| (2010-10-27) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 2: | Dipartimento di Sistemi e Informatica (DSI) |
|
|
|
Università degli studi di Firenze |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Combinatorics Computer Science/Discrete Mathematics |
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00530158, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00530158 | |
| oai:hal.archives-ouvertes.fr:hal-00530158 | |
| From: Mathilde Bouvel | |
| Submitted on: Wednesday, 27 October 2010 16:34:24 | |
| Updated on: Thursday, 28 October 2010 15:37:01 | |
