Pattern avoidance in flattened permutations

MaRDI QIDQ2915615zbMATH OpenFDO

Authors Toufik Mansour, Mark Shattuck

Publication date 18 September 2012

Published in PU.M.A. Pure Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

pattern avoidancepermutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Recommendations

• Pattern avoidance in partial permutations
• Pattern avoidance of generalized permutations
• Pattern avoidance in poset permutations
• Pattern avoidance in ``flattened partitions
• Pattern avoiding meandric permutations
• On pattern avoiding alternating permutations
• Pattern avoidance for random permutations
• Pattern avoidance by even permutations
• Avoiding patterns in irreducible permutations
• Enumerating pattern avoidance for affine permutations

Cited in

(11)

• Pattern avoidance in ``flattened partitions
• Counting subwords in flattened partitions of sets
• The runsort permuton
• On pattern avoiding flattened set partitions
• The sets of flattened partitions with forbidden patterns
• Recurrence relations in counting the pattern 13-2 in flattened permutations
• Recurrence relations for patterns of type (2,1) in flattened permutations
• Peaks are preserved under run-sorting
• Pattern avoidance in flattened derangements
• Triangular flattened partitions
• Avoidance of vincular patterns by flattened derangements

This page was built for publication: Pattern avoidance in flattened permutations

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