Random permutations on a set with a binary relation
Article
Received:
- 29 Downloads
Keywords
Binary Relation Random Permutation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Literature cited
- 1.D. M. Jackson and I. P. Goulden, “A formal calculus for the enumerative system of sequences, I, II, III,” Stud. Appl. Math.,61, 141–178 (1979);61, 245–277 (1979);62, 113–141 (1980).Google Scholar
- 2.E. A. Bander, “Asymptotic methods in enumeration,” SIAM Rev.,16, 485–515 (1974).Google Scholar
- 3.M. Dwass, “The number of increases in random permutation,” J. Combinatorial Theory, Ser. A,15, 192–199 (1973).Google Scholar
- 4.W. Dymacek and D. Roselle, “Circular permutations by number of rises and successions (note),” J. Combinatorial Theory, Ser. A,25, 196–201 (1978).Google Scholar
- 5.N. Mendelson, “The asymptotic series for certain classes of permutation problems,” Can. J. Math.,8, 234–244 (1956).Google Scholar
- 6.C. Stein, “Asymptotic evaluation of the number of Latin rectangles,” J. Combinatorial Theory, Ser. A,25, 38–49 (1978).Google Scholar
- 7.S. Tanny, “A probabilistic interpretation of Eulerian numbers,” Duke Math. J.,40, No. 4, 717–722 (1973).Google Scholar
- 8.S. Tanny, “Permutations and successions,” J. Combinatorial Theory, Ser. A,21, 196–202 (1976).Google Scholar
- 9.V. N. Sachkov, Probability Methods in Combinatorial Analysis [in Russian], Nauka, Moscow (1978).Google Scholar
- 10.P. O'Neil, “Asymptotic and random matrices with row-sum and column-sum restrictions,” Bull. Am. Math. Soc.,75, No. 6, 1276–1282 (1969).Google Scholar
- 11.G. M. Fikhtengol'ts, A Course of Differential and Integral Calculus [in Russian], Vol. 2, Nauka, Moscow (1970).Google Scholar
Copyright information
© Plenum Publishing Corporation 1984