Counting subwords in flattened permutations

DOI10.4310/JOC.2013.v4.n3.a4zbMath1275.05008arXiv1307.3637MaRDI QIDQ376559

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

Publication date: 5 November 2013

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

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

zbMATH Keywords

permutationkernel methodpattern avoidance

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)

Related Items (5)

On pattern avoiding flattened set partitions ⋮ Recurrence relations for patterns of type (2,1) in flattened permutations ⋮ Lipschitz polytopes of posets and permutation statistics ⋮ Recurrence relations in counting the pattern 13-2 in flattened permutations ⋮ Counting subwords in flattened partitions of sets

This page was built for publication: Counting subwords in flattened permutations