Recurrence relations for patterns of type (2,1) in flattened permutations

DOI10.1080/10236198.2013.812083zbMath1310.05010arXiv1306.3355OpenAlexW1987129084MaRDI QIDQ5746468

Toufik Mansour, Mark Shattuck, David G. L. Wang

Publication date: 18 February 2014

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3355

zbMATH Keywords

symmetric functionrecurrence relationpermutationpattern avoidance

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Counting subwords in flattened permutations
• Patterns in permutations and words.
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Counting occurrences of 132 in a permutation
• Pattern avoidance in ``flattened partitions
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
• Combinatorics of Compositions and Words

This page was built for publication: Recurrence relations for patterns of type (2,1) in flattened permutations