Recurrence relations in counting the pattern 13-2 in flattened permutations

DOI10.1080/10236198.2014.977273zbMath1316.05007arXiv1410.4109OpenAlexW2071588082MaRDI QIDQ5248187

Toufik Mansour, David G. L. Wang

Publication date: 28 April 2015

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

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

zbMATH Keywords

recurrence relationpermutationkernel methodflattened permutationpattern counting

Mathematics Subject Classification ID

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

Related Items (2)

On pattern avoiding flattened set partitions ⋮ Counting subwords in flattened partitions of sets

Cites Work

• 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
• Combinatorics of Set Partitions
• Combinatorics of Compositions and Words
• Recurrence relations for patterns of type (2,1) in flattened permutations

This page was built for publication: Recurrence relations in counting the pattern 13-2 in flattened permutations