Numéro
Quadrature
Numéro 76, Avril-Juin 2010
Page(s) 13 - 25
Section Combinatoire
DOI https://doi.org/10.1051/quadrature/2010001
Publié en ligne 18 mars 2010
  1. P. Biane, "Combien de fois faut-il battre un jeu de cartes ?", Gaz. Math. 91 (2002) 4–10.
  2. P.-Y. Chen, D.-H. Lawrie, P.-C. Yew and D.-A. Podera, "Interconnection networks using shuffles", Computer December (1981) 55–64.
  3. J.-H. Conway and R.-K. Guy, The book of numbers, Springer-Verlag, 1996.
  4. J.-P. Delahaye et P. Mathieu, "Images brouillées, images retrouvées", Pour la Science 242 (1997) 102–106.
  5. J.-P. Delahaye, "L'agent secret joue aux cartes", Pour la Science 284 (2001) 100–104.
  6. P. Diaconis and R. Graham, "The solutions to Elmsley's Problem", Math Horizons 14 (2007) 22–27.
  7. P. Diaconis, R.L. Graham and W.M. Kantor, "The mathematics of perfect shuffles", Adv. Appl. Math. 4 (1983) 175–191. [CrossRef]
  8. A. Elmsley, "Mathematics of the weave shuffle", The Pentagram 11 (1957) 70–71, 78–79, 85.
  9. S.-W. Golomb, "Permutations by cutting and shuffling", SIAM Rev. 3 (1961) 293–297. [CrossRef] [MathSciNet]
  10. I.-N. Herstein and I. Kaplansky, Matters Mathematical, Harper & Row, 1974.
  11. A. Lachal, "Quelques mélanges parfaits de cartes". Disponible sur arXiv: http://arxiv.org/abs/0910.0524 [math.HO] (2009).
  12. A. Lachal, "Mélanges parfaits de cartes (II) – Mélanges de Monge", Quadrature (à paraître).
  13. P. Lévy, "Étude d'une classe de permutations", C. R. Acad. Sci. 227 (1948) 422–423, 578–579.
  14. P. Lévy, "Sur deux classes de permutations", C. R. Acad. Sci. 228 (1949) 1089–1090.
  15. P. Lévy, "Sur quelques classes de permutations", Compositio Math. 8 (1950) 1–48. [MathSciNet]
  16. S.-B. Morris, "The basic mathematics of the Faro shuffle", Pi Mu Epsilon J. 6 (1973) 85–92.
  17. S.-B. Morris and R.-E. Hartwig, "The generalized Faro shuffle", Discrete Math. 15 (1976) 333–346. [CrossRef] [MathSciNet]
  18. J.-T. Schwartz, "Ultracomputers", ACM Trans. Program. Language Systems 2 (1980) 484–521. [CrossRef]
  19. H.-S. Stone, "Parallel processing with the perfect shuffle", IEEE Trans. Comput. 2 (1971) 153–161. [CrossRef]
  20. J.-V. Uspensky and M.-A. Heaslet, Elementary number theory, McGraw Hill, 1939.
  21. Shuffle, Wolfram Mathworld. http://mathworld.wolfram.com/Shuffle.html
    http://mathworld.wolfram.com/RiffleShuffle.html
    http://mathworld.wolfram.com/In-Shuffle.html
    http://mathworld.wolfram.com/Out-Shuffle.html
    http://mathworld.wolfram.com/MongesShuffle.html
  22. Shuffling, Wikipedia, the free encyclopedia. http://en.wikipedia.org/wiki/Shuffling.