Enumeration schemes for words avoiding permutations

MaRDI QIDQ3084744zbMATH OpenFDO

Authors Lara Pudwell

Publication date 25 March 2011

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Recommendations

• scientific article; zbMATH DE number 5557896
• Enumeration Schemes for Restricted Permutations
• Enumeration schemes for vincular patterns
• Enumeration of some classes of words avoiding two generalized patterns of length three
• Refining enumeration schemes to count according to the inversion number

Cited in

(18)

• Enumeration schemes for vincular patterns
• scientific article; zbMATH DE number 5557896 (Why is no real title available?)
• Refining enumeration schemes to count according to permutation statistics
• Pattern avoidance in ordered set partitions
• Enumeration of Dumont permutations avoiding certain four-letter patterns
• The (ordinary) generating functions enumerating 123-avoiding words with r occurrences of each of 1, 2, , n are always algebraic
• Enumeration schemes for permutations avoiding barred patterns
• Words over a finite alphabet avoiding 1243
• Subregularity in infinitely labeled generating trees of restricted permutations
• Finite automata and pattern avoidance in words
• Refining enumeration schemes to count according to the inversion number
• On avoiding 1233
• Enumeration Schemes for Restricted Permutations
• Enumeration of some classes of words avoiding two generalized patterns of length three
• Enumeration schemes and, more importantly, their automatic generation
• Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
• Increasing consecutive patterns in words
• Enumerative results on the Schröder pattern poset

Describes a project that uses

Uses Software

• InsEnc

This page was built for publication: Enumeration schemes for words avoiding permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084744)