Pages that link to "Item:Q2500970"
From MaRDI portal
The following pages link to Three-letter-pattern avoiding permutations and functional equations (Q2500970):
Displaying 17 items.
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (Q295298) (← links)
- Using functional equations to enumerate 1324-avoiding permutations (Q402577) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
- Words restricted by 3-letter generalized multipermutation patterns (Q1400799) (← links)
- The structure of invertible substitutions on a three-letter alphabet (Q1883415) (← links)
- Kernel method and linear recurrence system (Q2483349) (← links)
- Kernel method and system of functional equations (Q2519703) (← links)
- (Q5121940) (← links)
- (Q5210579) (← links)
- (Q5463495) (← links)
- (Q5754493) (← links)
- Some Transformation Schemes Involving the Special (132)-Avoiding Permutation Patterns and a Binary Coding: An Algorithmic Approach (Q5894242) (← links)
- Some Transformation Schemes Involving the Special (132)-Avoiding Permutation Patterns and a Binary Coding: An Algorithmic Approach (Q5894410) (← links)
- Refined consecutive pattern enumeration via a generalized cluster method (Q6161648) (← links)
