✦ LIBER ✦

Factorization of permutations into n-cycles

✍ Scribed by Richard P. Stanley

Book ID: 107748378
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 701 KB
Volume: 37
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90224-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

How many ways can a permutation be facto

How many ways can a permutation be factored into two n-cycles?

✍ David W. Walkup 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Short factorizations of permutations int

Short factorizations of permutations into transpositions

✍ J.A. Eidswick 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 489 KB

The number of factorizations of an n-cycle into n -1 transpositions is determined under the assumption that factorizations are counted as different if and only if they cannot be commuted into one another.

A transposition factorization of walk-pe

A transposition factorization of walk-permutations in graphs

✍ Amitai Regev 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Hamilton cycles in the union of random p

Hamilton cycles in the union of random permutations

✍ Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

Random and Exhaustive Generation of Perm

Random and Exhaustive Generation of Permutations and Cycles

✍ Mark C. Wilson 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 254 KB

Universal cycles of k-subsets and k-perm

Universal cycles of k-subsets and k-permutations

✍ B.W. Jackson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 701 KB

In this paper the author constructs universal cycles of 3-subsets of an n-set for n 28 and (n, 3)= 1, verifying a conjecture of Chung et al. ( ) for 3-subsets. Universal cycles of 4-subsets of an n-set for n > 8 and (n, 4) = 1 are also constructed, partially solving the same conjecture for 4-subsets