English

On permutations avoiding the dashed patterns 32-41 and 41-32

Combinatorics 2014-05-09 v1

Abstract

We show that permutations of size nn avoiding both of the dashed patterns 32-41 and 41-32 are equinumerous with indecomposable set partitions of size n+1n+1, and deduce a related result.

Keywords

Cite

@article{arxiv.1405.2064,
  title  = {On permutations avoiding the dashed patterns 32-41 and 41-32},
  author = {David Callan},
  journal= {arXiv preprint arXiv:1405.2064},
  year   = {2014}
}

Comments

7 pages

R2 v1 2026-06-22T04:09:37.065Z