✦ LIBER ✦

Generation of Permutations by Adjacent Transposition

✍ Scribed by Selmer M. Johnson

Book ID: 120038993
Publisher: American Mathematical Society
Year: 1963
Tongue: English
Weight: 149 KB
Volume: 17
Category: Article
ISSN: 0025-5718
DOI: 10.2307/2003846

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reflection-free permutations, rosary per

Reflection-free permutations, rosary permutations, and adjacent transposition algorithms

✍ Roy, Mohit Kumar 📂 Article 📅 1973 🏛 Association for Computing Machinery 🌐 English ⚖ 268 KB

Transposition generation of alternating

Transposition generation of alternating permutations

✍ Frank Ruskey 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 383 KB

Generating Linear Extensions by Adjacent

Generating Linear Extensions by Adjacent Transpositions

✍ D.B. West 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Generating a random permutation with ran

Generating a random permutation with random transpositions

✍ Persi Diaconis; Mehrdad Shahshahani 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 904 KB

Sorting of Permutations by Cost-Constrai

Sorting of Permutations by Cost-Constrained Transpositions

✍ Farnoud, F.; Milenkovic, O. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 731 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.