Énumération de classes de permutations

Alain Guenoche

RAIRO - Operations Research - Recherche Opérationnelle (1979)

  • Volume: 13, Issue: 4, page 379-390
  • ISSN: 0399-0559

How to cite

top

Guenoche, Alain. "Énumération de classes de permutations." RAIRO - Operations Research - Recherche Opérationnelle 13.4 (1979): 379-390. <http://eudml.org/doc/104741>.

@article{Guenoche1979,
author = {Guenoche, Alain},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {free monoid; enumeration method; set of permutations; cycles in permutations},
language = {fre},
number = {4},
pages = {379-390},
publisher = {EDP-Sciences},
title = {Énumération de classes de permutations},
url = {http://eudml.org/doc/104741},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Guenoche, Alain
TI - Énumération de classes de permutations
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 4
SP - 379
EP - 390
LA - fre
KW - free monoid; enumeration method; set of permutations; cycles in permutations
UR - http://eudml.org/doc/104741
ER -

References

top
  1. 1. C. BERGE, Principes de combinatoire, Dunod, Paris, 1968. Zbl0227.05001MR237346
  2. 2. G. EHRLICH, Loopless Algorithms for Generating Permutations and other Combinatorial Configurations, Journal of A.C.M., vol. 20, n° 3, 1973. Zbl0266.68018MR366085
  3. 3. W. FERNANDEZ DE LA VEGA et A. GUENOCHE, Génération des partitions aléatoires uniformément distribuées, Actes du Colloque A.F.C.E.T.-S.M.F. Palaiseau, 1978, p. 285, 291. Zbl0484.60015
  4. 4. A. GUENOCHE, Énumération des tableaux standards, Discrete Math., vol. 25, 1979, p. 1-11. Zbl0402.05005MR534942
  5. 5. F. M. IVES, Permutation Enumeration : Four New Permutation Algorithms, Communication A.C.M., vol. 19, n° 2, 1976, p. 68-72. Zbl0316.05007
  6. 6. S. M. JOHNSON, Generation of Permutation by Adjacent Transpositions, Math. Comp., vol. 17, 1963. Zbl0114.01203MR159764
  7. 7. A. NIJENMUIS et H. S. WILF, Combinatorial Algorithms, Academic Press, 1975. Zbl0343.68004
  8. 8. J. RIORDAN, An Introduction to Combinatorial Analysis, J. Wiley, 1958. Zbl0078.00805MR96594
  9. 9. H. S. WILF, An Unified Setting for Sequencing, Ranking, and Selection Algorithms for Combinatorial Objects, Advances in Math., vol. 24, 1977, p. 281-291. Zbl0354.05041MR441754
  10. 10. S. G. WILLIAMSON, On the Ordering, Ranking and Random Generation of Basic Combinatorial Sets, Lecture Notes in Math., n° 579, 1977. Zbl0362.05006MR491212

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.