The following pages link to The forgotten monoid (Q3533333):
Displaying 8 items.
- What makes a \(\mathbf D_0\) graph Schur positive? (Q345152) (← links)
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns (Q396920) (← links)
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns (Q405257) (← links)
- Noncommutative Schur functions, switchboards, and Schur positivity (Q508441) (← links)
- Rules of three for commutation relations (Q1702697) (← links)
- From Hertzsprung's problem to pattern-rewriting systems (Q2109220) (← links)
- New results on families of pattern-replacement equivalences (Q2182197) (← links)
- Counting the Nontrivial Equivalence Classes of $S_n$ under $\{1234,3412\}$-Pattern-Replacement (Q5129982) (← links)
