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

MaRDI QIDQ405257zbMATH OpenFDO

Authors 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, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p47

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

permutation patternspattern replacements

Mathematics Subject Classification ID

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

Abstract: We explore a new type of replacement of patterns in permutations, suggested by James Propp, that does not preserve the length of permutations. In particular, we focus on replacements between 123 and a pattern of two integer elements. We apply these replacements in the classical sense; that is, the elements being replaced need not be adjacent in position or value. Given each replacement, the set of all permutations is partitioned into equivalence classes consisting of permutations reachable from one another through a series of bi-directional replacements. We break the eighteen replacements of interest into four categories by the structure of their classes and fully characterize all of their classes.

Recommendations

• Counting permutations modulo pattern-replacement equivalences for three-letter patterns
• New results on families of pattern-replacement equivalences
• Equivalence classes of permutations modulo excedances
• Adjacent transformations in permutations
• Equivalence relations of permutations generated by constrained transpositions

Cites work

• scientific article; zbMATH DE number 3817997 (Why is no real title available?)
• scientific article; zbMATH DE number 1047928 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• 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
• Longest Increasing and Decreasing Subsequences
• New results on families of pattern-replacement equivalences
• Patterns in permutations and words.
• Permutations, matrices, and generalized Young tableaux
• Restricted permutations
• THE CHINESE MONOID
• The forgotten monoid

Cited in

(8)

• 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
• Counting the nontrivial equivalence classes of \(S_n\) under \(\{1234, 3412\}\)-pattern-replacement
• Adjacent transformations in permutations
• Equivalence relations of permutations generated by constrained transpositions
• Equivalence classes of permutations under various relations generated by constrained transpositions
• New results on families of pattern-replacement equivalences
• Equivalence classes of permutations modulo excedances

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405257)