A permutations representation that knows what “Eulerian” means.
Mantaci, Roberto; Rakotondrajao, Fanja
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)
- Volume: 4, Issue: 2, page 101-108
- ISSN: 1365-8050
Access Full Article
topHow to cite
topMantaci, Roberto, and Rakotondrajao, Fanja. "A permutations representation that knows what “Eulerian” means.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 101-108. <http://eudml.org/doc/121086>.
@article{Mantaci2001,
author = {Mantaci, Roberto, Rakotondrajao, Fanja},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {subexceedant functions; exceedances; Eulerian numbers; derangements; parity of a permutation},
language = {eng},
number = {2},
pages = {101-108},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {A permutations representation that knows what “Eulerian” means.},
url = {http://eudml.org/doc/121086},
volume = {4},
year = {2001},
}
TY - JOUR
AU - Mantaci, Roberto
AU - Rakotondrajao, Fanja
TI - A permutations representation that knows what “Eulerian” means.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2001
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 4
IS - 2
SP - 101
EP - 108
LA - eng
KW - subexceedant functions; exceedances; Eulerian numbers; derangements; parity of a permutation
UR - http://eudml.org/doc/121086
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.