A combinatorial description of the spectrum for the tsetlin library and its generalization to hyperplane arrangements

Duke Mathematical Journal

Volumn 99, Issue 1, 1999, Pages 135-174

  Bidigare, Pat ^a   Hanlon, Phil ^b   Rockmore, Dan ^c  

^a ERIM International   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001113836     PISSN: 00127094     EISSN: None     Source Type: Journal    
DOI: 10.1215/S0012-7094-99-09906-4     Document Type: Article

References (16)

1. D. Bayer and P. Diaconis, Trailing the dovetail shuffle to its lair, Ann. Appl. Prob. 2 (1992), 294-313.
2. K. Brown and P. Diaconis, Random walk and hyperplane arrangements, to appear.
3. P. Diaconis, Group Representations in Probability and Statistics, IMS Lecture Notes Monogr. Ser. 11, Inst. Math. Statist., Hayward, Calif., 1988.
4. P. Diaconis, The cutoff phenomenon in finite Markov chains, Proc. Nat. Acad. Sci. U.S.A. 93 (1996), 1659-1664.
5. P. Diaconis, J. Fill, and J. Pitman, Analysis of top to random shuffles, Combin. Probab. Comput. 1 (1992), 135-155.
6. P. Diaconis, M. McGrath, and J. Pitman, Riffle shuffles, cycles and descents, Combina-torica 15 (1995), 11-29.
7. P. Donnelly, The heaps process, libraries, and size-biased permutations, J. Appl. Probab. 28 (1991), 321-335.
8. J. Fill, An exact formula for the move-to-front rule for self-organizing lists, J. Theoret. Probab. 9 (1996), 113-160.
9. J. Fill and L. Holst, On the distribution of search cost for the move-to-front rule, Random Structures Algorithms 8 (1996), 179-186.
10. n on the components of the Hodge decomposition of Hochschild homology, Michigan Math. J. 37 (1990), 105-124.
11. S. Kapoor and E. Reingold, Stochastic rearrangement rules for self-organizing data structures, Algorithmica 6 (1991), 278-291.
12. P. Orlik and H. Terao, Arrangements of Hyperplanes, Grundlehren Math. Wiss. 300, Springer-Verlag, Berlin, 1992.
13. R. Phatarfod, On the matrix occurring in a linear search problem, J. Appl. Probab. 28 (1991), 336-346.
14. R. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth & Brooks/Cole Math. Ser., Wadsworth & Brooks/Cole Adv. Books & Software, Monterey, Calif., 1986.
15. A. Varchenko, Bilinear form of real configuration of hyperplanes, Adv. Math. 97 (1993), 110-144.
16. T. Zaslavsky, Facing up to arrangements: Face-count formulas for partitions of space by hyperplanes, Mem. Amer. Math. Soc. 1 (1975), no. 154.