Adjacent transformations in permutations
From MaRDI portal
Recommendations
- Equivalence relations of permutations generated by constrained transpositions
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
- Equivalence classes of permutations under various relations generated by constrained transpositions
- Equivalence classes of permutations modulo excedances
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
Cited in
(11)- Permutability class of a semigroup
- From Hertzsprung's problem to pattern-rewriting systems
- New results on families of pattern-replacement equivalences
- A noncommutative cycle index and new bases of quasi-symmetric functions and noncommutative symmetric functions
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
- Adjoining Almost Disjoint Permutations
- Equivalence relations of permutations generated by constrained transpositions
- Counting the nontrivial equivalence classes of \(S_n\) under \(\{1234, 3412\}\)-pattern-replacement
- Equivalence classes of permutations under various relations generated by constrained transpositions
- Computing cardinalities of subsets on S_n with k adjacencies
This page was built for publication: Adjacent transformations in permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960003)