Equivalence relations of permutations generated by constrained transpositions
From MaRDI portal
Recommendations
- Equivalence classes of permutations under various relations generated by constrained transpositions
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Equivalence classes of permutations modulo excedances
- Adjacent transformations in permutations
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
Cited in
(12)- New results on families of pattern-replacement equivalences
- A noncommutative cycle index and new bases of quasi-symmetric functions and noncommutative symmetric functions
- An equivalence relation on the symmetric group and multiplicity-free flag \(h\)-vectors
- Representing permutations with few moves
- Adjacent transformations in permutations
- Перестановочные решетки отношений эквивалентности на декартовых произведениях и согласованные с ними системы уравнений. II
- scientific article; zbMATH DE number 4021204 (Why is no real title available?)
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
- Counting the nontrivial equivalence classes of \(S_n\) under \(\{1234, 3412\}\)-pattern-replacement
- Equivalence classes of permutations under various relations generated by constrained transpositions
- Configurations of conjugate permutations
This page was built for publication: Equivalence relations of permutations generated by constrained transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591353)
