[1] D. Aldous. Random walks on finite groups and rapidly mixing Markov chains. In Seminar on probability, XVII,
volume 986 of Lecture Notes in Math., pages 243–297. Springer, Berlin, 1983.
[2] D. Aldous and P. Diaconis. Shuffling cards and stopping times. Amer. Math. Monthly, 93(5):333–348, 1986.
[3] D. Bayer and P. Diaconis. Trailing the dovetail shuffle to its lair. Ann. Appl. Probab., 2(2):294–313, 1992.
[4] S. Boyd, P. Diaconis, P. Parrilo, and L. Xiao. Symmetry analysis of reversible Markov chains. Internet Math.,
2(1):31–71, 2005.
[5] T. Ceccherini-Silberstein, F. Scarabotti, and F. Tolli. Harmonic analysis on finite groups, volume 108 of Cam-
bridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2008. Representation theory,
Gelfand pairs and Markov chains.
[6] G.-Y. Chen and L. Saloff-Coste. The cutoff phenomenon for randomized riffle shuffles. Random Structures Algo-
rithms, 32(3):346–3745, 2008.
[7] M. Ciucu. No-feedback card guessing for dovetail shuffles. Ann. Appl. Probab., 8(4):1251–1269, 1998.
[8] M. Conger and D. Viswanath. Riffle shuffles of decks with repeated cards. Ann. Probab., 34(2):804–819, 2006.
[9] M. Conger and D. Viswanath. Normal approximations for descents and inversions of permutations of multisets.
J. Theoret. Probab., 20(2):309–325, 2007.
[10] P. Diaconis. Group representations in probability and statistics. Institute of Mathematical Statistics Lecture
Notes—Monograph Series, 11. Institute of Mathematical Statistics, Hayward, CA, 1988.
[11] P. Diaconis. Mathematical developments from the analysis of riffle shuffling. In Groups, combinatorics & geometry
(Durham, 2001), pages 73–97. World Sci. Publ., River Edge, NJ, 2003.
[12] P. Diaconis and J. Fulman. Carries, shuffling and an amazing matrix. preprint, 2008.
[13] P. Diaconis and S. P. Holmes. Random walks on trees and matchings. Electron. J. Probab., 7:no. 6, 17 pp.
(electronic), 2002.
[14] P. Diaconis, M. McGrath, and J. Pitman. Riffle shuffles, cycles, and descents. Combinatorica, 15(1):11–29, 1995.
[15] P. Diaconis and M. Shahshahani. Generating a random permutation with random transpositions. Z. Wahrsch.
Verw. Gebiete, 57(2):159–179, 1981.
[16] A. F?assler and E. Stiefel. Group theoretical methods and their applications. Birkh?auser Boston Inc., Boston, MA,
1992. Translated from the German by Baoswan Dzung Wong.
[17] J. Fulman. Applications of symmetric functions to cycle and increasing subsequence structure after shuffles. J.
Algebraic Combin., 16(2):165–194, 2002.
[18] M. Gardner. Martin Gardner’s New Mathematical Diversions from Scientific American. Simon & Schuster, New
York, 1966.
[19] E. Gilbert. Theory of shuffling. Technical memorandum, Bell Laboratories, 1955.
[20] J. M. Holte. Carries, combinatorics, and an amazing matrix. Amer. Math. Monthly, 104(2):138–149, 1997.
[21] J. Reeds. Theory of shuffling. Unpublished manuscript, 1976.
[22] J.-P. Serre. Linear representations of finite groups. Springer-Verlag, New York, 1977. Translated from the second
French edition by Leonard L. Scott, Graduate Texts in Mathematics, Vol. 42.
[23] J. R. Weaver. Centrosymmetric (cross-symmetric) matrices, their basic properties, eigenvalues, and eigenvectors.
Amer. Math. Monthly, 92(10):711–717, 1985.