Enumerating rc-invariant permutations with no long decreasing subsequences

DOI10.1007/S00026-010-0053-6MaRDI QIDQ659582zbMATH OpenOpenAlexFDO

Authors Eric S. Egge

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

domino tableauxpattern-avoiding permutationrestricted permutationreversecomplement mapRobinson-Schensted-Knuth correspondencetableaux

Mathematics Subject Classification ID

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

Recommendations

• On two related questions of Wilf concerning standard Young tableaux
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Bijective enumeration of permutations starting with a longest increasing subsequence
• scientific article; zbMATH DE number 3559589
• The number of inversions of permutations with fixed shape

Cites work

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

Cited in

(10)

• The number of involutions with \(r\) fixed points and a long increasing subsequence
• Vexillary signed permutations revisited
• Pattern-avoiding permutation powers
• Counting signed vexillary permutations
• Inversions and longest increasing subsequence for \(k\)-card-minimum random permutations
• Permutation q-enumeration with the Schur row adder
• Bijective enumeration of permutations starting with a longest increasing subsequence
• On the centrosymmetric permutations in a class
• Skew standard domino tableaux and partial Motzkin paths
• The Schützenberger involution over Dyck paths

This page was built for publication: Enumerating \(r\)c-invariant permutations with no long decreasing subsequences

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