Words restricted by 3-letter generalized multipermutation patterns
From MaRDI portal
Abstract: We find exact formulas and/or generating functions for the number of words avoiding 3-letter generalized multipermutation patterns and find which of them are equally avoided.
Recommendations
- scientific article; zbMATH DE number 5181754
- Restricted 1-3-2 permutations and generalized patterns
- Enumeration of some classes of words avoiding two generalized patterns of length three
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Three-letter-pattern avoiding permutations and functional equations
- Permutations restricted by two distinct patterns of length three
- Centrosymmetric words avoiding 3-letter permutation patterns
- scientific article; zbMATH DE number 2192121
- Pattern-restricted permutations composed of 3-cycles
- scientific article; zbMATH DE number 1868918
Cited in
(11)- Counting words with Laguerre series
- Consecutive patterns in Catalan words and the descent distribution
- Some results on the avoidance of vincular patterns by multisets
- Restricted k-ary words and functional equations
- Permutations and words counted by consecutive patterns
- Multiple constraints on three and four words
- A new class of multiset Wilf equivalent pairs
- Generalized pattern avoidance
- scientific article; zbMATH DE number 5181754 (Why is no real title available?)
- scientific article; zbMATH DE number 1868918 (Why is no real title available?)
- Segmental partially ordered generalized patterns
This page was built for publication: Words restricted by 3-letter generalized multipermutation patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400799)