✦ LIBER ✦

Counting permutations

✍ Scribed by Ethan D Bolker; Andrew M Gleason

Book ID: 103509388
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 383 KB
Volume: 29
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90012-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting -avoiding permutations

✍ M.D. Atkinson; Bruce E. Sagan; Vincent Vatter 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Counting Special Permutations

✍ Bertram, Edward A.; Gordon, Basil 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Counting Simsun Permutations by Descents

✍ Chak-On Chow; Wai Chee Shiu 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 280 KB

Counting Permutations by Their Rigid Pat

Counting Permutations by Their Rigid Patterns

✍ A.N Myers 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 142 KB

In how many permutations does the pattern t occur exactly m times? In most cases, the answer is unknown. When we search for rigid patterns, on the other hand, we obtain exact formulas for the solution, in all cases considered. # 2002 Elsevier Science (USA)

Counting permutations by successions and

Counting permutations by successions and other figures

✍ James W. Reilly; Stephen M. Tanny 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 836 KB

Counting orbits of a product of permutat

Counting orbits of a product of permutations

✍ Richard Z. Goldstein; Edward C. Turner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A formula is derived for the number of orbits of a product of permutation in terms of the number of orbits of the factors and the nullity of a matrix.