Pages that link to "Item:Q1305201"
From MaRDI portal
The following pages link to Enumeration schemes and, more importantly, their automatic generation (Q1305201):
Displaying 16 items.
- WILF (Q23583) (← links)
- Some enumerative results related to ascent sequences (Q393161) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- Enumeration schemes for vincular patterns (Q418874) (← links)
- Catalan numbers and pattern restricted set partitions (Q456885) (← links)
- Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
- Finite transition matrices for permutations avoiding pairs of length four patterns (Q1398262) (← links)
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 (Q1945952) (← links)
- Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
- Counting subwords in flattened partitions of sets (Q2352065) (← links)
- Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia (Q2490021) (← links)
- Automatic discovery of structural rules of permutation classes (Q4629385) (← links)
- Enumeration Schemes for Restricted Permutations (Q5448994) (← links)
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences (Q6170819) (← links)
