✦ LIBER ✦

Lexicographic permutations with restrictions

✍ Scribed by Donald E Knuth

Book ID: 104182580
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 727 KB
Volume: 1
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(79)90018-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating alternating permutations lexi

Generating alternating permutations lexicographically

✍ Bruce Bauslaugh; Frank Ruskey 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 465 KB

Restricted permutations

✍ M.D. Atkinson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 615 KB

Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations t

Restricted Dumont Permutations

✍ Alexander Burstein 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 139 KB

Restricted Symmetric Permutations

✍ Eric S. Egge 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 375 KB

A systolic design for generating permuta

A systolic design for generating permutations in lexicographic order

✍ Wei-Ping Lee; Jong-Chuang Tsay 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Permutations with Restricted Patterns an

Permutations with Restricted Patterns and Dyck Paths

✍ C. Krattenthaler 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 190 KB

We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern 12 k follow directly from old results on the enu