×

The mathematics of perfect shuffles. (English) Zbl 0521.05005


MSC:

05A05 Permutations, words, matrices
20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ball, W. W.R; Coxeter, H. M.S, (Mathematical Recreations and Essays (1974), University of Toronto Press: University of Toronto Press Buffalo)
[2] Borcherds, R.; Conway, J. H.; Queen, L.; Sloane, N. J.A, A Monster Lie Algebra?, (Technical Report (1982), Bell Laboratories: Bell Laboratories Murray Hill, N.J) · Zbl 0555.17004
[3] Brock, H. K.; Brooks, B. J.; Sullivan, F., Diamond, a sorting method for vector machines, BIT, 21, 142-152 (1981) · Zbl 0457.68054
[4] Chen, P. Y.; Lawrie, D. H.; Yew, P. C.; Podera, D. A., Interconnection networks using shuffles, Computer, 55-64 (1981), December
[5] Coxeter, H. M.S, Regular Polytopes (1948), Methuen: Methuen London · Zbl 0031.06502
[6] Davio, M., Kronecker products and shuffle algebra, IEEE Trans. Comput., C-30, 116-125 (1981) · Zbl 0455.94050
[7] Furst, M.; Hopcroft, J.; Luks, E., Polynomial-time algorithms for permutation groups, (Proc. 21st FOCS (1980)), 36-41
[8] Gardner, M., Mathematical Carnival (1975), Knopf: Knopf New York
[9] Golomb, S. W., Permutations by cutting and shuffling, SIAM Rev., 3, 293-297 (1961) · Zbl 0104.00803
[10] Hartwig, R. E.; Morris, S. B., The universal flip matrix and the generalized Faro shuffle, Pacific J. Math., 58, 445-455 (1975) · Zbl 0316.15013
[11] Herstein, I. N.; Kaplansky, I., Matters Mathematical (1974), Harper & Row: Harper & Row New York · Zbl 0386.00001
[12] Kleitman, D.; Leighton, F.; Lepley, M.; Miller, G., New Layouts for the Shuffle-Exchange Graph, (Technical report (1980), Applied Mathematics Department, M.I.T: Applied Mathematics Department, M.I.T Cambridge, Mass)
[13] Levy, P., Étude d’une classe de permutations, C. R. Acad. Sci., 227, 422-423 (1948) · Zbl 0033.34201
[14] Levy, P., Étude d’une nouvelle classe de permutations, C. R. Acad. Sci., 227, 578-579 (1948) · Zbl 0033.34202
[15] Levy, P., Sur deux classes de permutations, C. R. Acad. Sci., 228, 1089-1090 (1949) · Zbl 0033.00702
[16] Levy, P., Un problem de la théorie des permutations, (Conf. École Polyt. (May 24, 1949))
[17] Levy, P., Sur une classe remarquable de permutations, Bull. Acad. Roy. Belgique, 2, 361-377 (1949) · Zbl 0033.00703
[18] Levy, P., Sur quelque classes de permutations, Compositio Math., 8, 1-48 (1950) · Zbl 0034.29505
[19] Levy, P., Quelques aspects de la pensée d’un mathématician (1970), Blanchard: Blanchard Paris · Zbl 0219.01020
[20] S. B. Morris\(Q\); S. B. Morris\(Q\)
[21] Morris, S. B., The basic mathematics of the Faro shuffle, Pi Mu Epsilon J., 6, 85-92 (1975) · Zbl 0361.20043
[22] Morris, S. B.; Hartwig, R. E., The generalized Faro shuffle, Discrete Math., 15, 333-346 (1976) · Zbl 0334.05034
[23] Schwartz, J. T., Ultracomputers, ACM Trans. Program. Language Systems, 2, 484-521 (1980) · Zbl 0468.68027
[24] Sims, C. C., Computational methods in the study of permutation groups, (Leech, John, “Computational Problems in Abstract Algebra,” Proc. Conf.. “Computational Problems in Abstract Algebra,” Proc. Conf., Oxford, 1967 (1970), Pergamon: Pergamon Oxford), 169-183 · Zbl 0215.10002
[25] Stone, H. S., Parallel processing with the perfect shuffle, IEEE Trans. Comput., 2, 153-161 (1971) · Zbl 0214.42703
[26] Uspensky, J. V.; Heaslet, M. A., Elementary Number Theory (1939), McGraw-Hill: McGraw-Hill New York · Zbl 0022.30602
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.