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

preprint2014arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.