Enumerating \(r\)c-invariant permutations with no long decreasing subsequences

DOI10.1007/s00026-010-0053-6zbMath1233.05010OpenAlexW2028855340MaRDI QIDQ659582

Egge, Eric S.

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-010-0053-6

zbMATH Keywords

tableauxdomino tableauxpattern-avoiding permutationRobinson-Schensted-Knuth correspondencerestricted permutationreversecomplement map

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items

Pattern-avoiding permutation powers, Counting signed vexillary permutations, Skew standard domino tableaux and partial Motzkin paths, Vexillary signed permutations revisited, The Schützenberger involution over Dyck paths, On the centrosymmetric permutations in a class

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric permutations avoiding two patterns
• Symmetric functions and P-recursiveness
• An extension of Schensted's theorem
• Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• The Robinson-Schensted and Schützenberger algorithms, an elementary approach
• Restricted symmetric permutations
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• On the Representations of the Symmetric Group
• Motzkin numbers
• Restricted permutations