Skip to Main content Skip to Navigation
Conference papers

Equivalence Relations of Permutations Generated by Constrained Transpositions

Abstract : We consider a large family of equivalence relations on permutations in $S_n$ that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one can be obtained from the other by a sequence of pattern-replacing moves of prescribed form; however, we limit our focus to patterns where two elements are transposed, conditional upon the presence of a third element of suitable value and location. For some relations of this type, we compute the number of equivalence classes, determine how many $n$-permutations are equivalent to the identity permutation, or characterise this equivalence class. Although our results include familiar integer sequences (e.g., Catalan, Fibonacci, and Tribonacci numbers) and special classes of permutations (layered, connected, and $123$-avoiding), some of the sequences that arise appear to be new.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 24, 2015 - 3:46:28 PM
Last modification on : Tuesday, October 20, 2020 - 5:28:03 PM
Long-term archiving on: : Wednesday, November 25, 2015 - 5:17:52 PM


Publisher files allowed on an open archive




Stephen Linton, James Propp, Tom Roby, Julian West. Equivalence Relations of Permutations Generated by Constrained Transpositions. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.909-920, ⟨10.46298/dmtcs.2841⟩. ⟨hal-01186269⟩



Record views


Files downloads