Counting permutations modulo pattern-replacement equivalences for three-letter patterns
From MaRDI portal
Publication:396920
zbMath1295.05016arXiv1304.5667MaRDI QIDQ396920
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.5667
Related Items
New results on families of pattern-replacement equivalences, Equivalence classes of permutations modulo replacements between 123 and two-integer patterns, A noncommutative cycle index and new bases of quasi-symmetric functions and noncommutative symmetric functions, From Hertzsprung's problem to pattern-rewriting systems
Uses Software
Cites Work