Pages that link to "Item:Q5952148"
From MaRDI portal
The following pages link to Permutations of a multiset avoiding permutations of length 3 (Q5952148):
Displaying 16 items.
- Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method (Q277629) (← links)
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (Q295298) (← links)
- Pattern avoidance in poset permutations (Q304187) (← links)
- Enumeration formulæ for pattern restricted Stirling permutations (Q456658) (← links)
- Finite automata and pattern avoidance in words (Q1775550) (← links)
- Central limit theorems for patterns in multiset permutations and set partitions (Q2180386) (← links)
- Pattern avoidance in biwords (Q2237219) (← links)
- Pattern avoidance of generalized permutations (Q2417191) (← links)
- A new class of multiset Wilf equivalent pairs (Q2455577) (← links)
- Pattern avoidance in compositions and multiset permutations (Q2490028) (← links)
- Stack-sorting for Words (Q3300688) (← links)
- Sorting Cayley permutations with pattern-avoiding machines (Q5000313) (← links)
- On avoiding 1233 (Q5045252) (← links)
- Crossings over permutations avoiding some pairs of patterns of length three (Q5113816) (← links)
- (Q5197595) (← links)
- Words over a finite alphabet avoiding 1243 (Q6618737) (← links)
