Equivalence classes of permutations modulo replacements between 123 and two-integer patterns

zbMath1300.05009arXiv1309.4802MaRDI QIDQ405257

Vahid Fazel-Rezai

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.4802

zbMATH Keywords

permutation patternspattern replacements

Mathematics Subject Classification ID

Partitions of sets (05A18) Permutations, words, matrices (05A05)

Related Items (1)

A noncommutative cycle index and new bases of quasi-symmetric functions and noncommutative symmetric functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting permutations modulo pattern-replacement equivalences for three-letter patterns
• Patterns in permutations and words.
• New results on families of pattern-replacement equivalences
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• The forgotten monoid
• THE CHINESE MONOID
• Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions
• Restricted permutations

This page was built for publication: Equivalence classes of permutations modulo replacements between 123 and two-integer patterns