New results on families of pattern-replacement equivalences
From MaRDI portal
Publication:2182197
DOI10.1016/J.DISC.2020.111878zbMATH Open1440.05007OpenAlexW3013338467MaRDI QIDQ2182197FDOQ2182197
Authors: William Kuszmaul, Ziling Zhou 
Publication date: 21 May 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111878
Recommendations
- 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 relations of permutations generated by constrained transpositions
- Equivalence classes of permutations under various relations generated by constrained transpositions
Cites Work
- Permutations, matrices, and generalized Young tableaux
- Restricted permutations
- The forgotten monoid
- Adjacent transformations in permutations
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Equivalence classes of permutations under various relations generated by constrained transpositions
- An equivalence relation on the symmetric group and multiplicity-free flag \(h\)-vectors
Cited In (4)
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
- From Hertzsprung's problem to pattern-rewriting systems
- Counting the nontrivial equivalence classes of \(S_n\) under \(\{1234, 3412\}\)-pattern-replacement
This page was built for publication: New results on families of pattern-replacement equivalences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182197)
