✦ LIBER ✦

Almost avoiding permutations

✍ Scribed by Robert Brignall; Shalosh B. Ekhad; Rebecca Smith; Vincent Vatter

Book ID: 108114171
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 385 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.06.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shape Avoiding Permutations

✍ Ron M. Adin; Yuval Roichman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Permutations avoiding all patterns of a given shape (in the sense of Robinson, Schensted, and Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook and deduce an exponential growth rate for their number.

Restricted 132-Avoiding Permutations

✍ Toufik Mansour; Alek Vainshtein 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 104 KB

We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.

Symmetric Permutations Avoiding Two Patt

Symmetric Permutations Avoiding Two Patterns

✍ David Lonoff; Jonah Ostroff 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 265 KB

Permutations avoiding consecutive patter

Permutations avoiding consecutive patterns, II

✍ Richard Warlimont 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 69 KB

Adjoining Almost Disjoint Permutations

✍ Yi Zhang 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

We show that it is consistent with ZFC + ¬CH that there is a maximal almost disjoint permutation family A ⊆ Sym(N) such that A is a proper subset of an eventually different family E ⊆ N N and |A| < |E|. We also ask several questions in this area.

Permutations of a Multiset Avoiding Perm

Permutations of a Multiset Avoiding Permutations of Length 3

✍ M.H. Albert; R.E.L. Aldred; M.D. Atkinson; C. Handley; D. Holton 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

We consider permutations of a multiset which do not contain certain ordered patterns of length 3. For each possible set of patterns we provide a structural description of the permutations avoiding those patterns, and in many cases a complete enumeration of such permutations according to the underlyi