On permutations avoiding the dashed patterns 32-41 and 41-32
D Callan�- arXiv preprint arXiv:1405.2064, 2014 - arxiv.org
D Callan
arXiv preprint arXiv:1405.2064, 2014•arxiv.orgarXiv:1405.2064v1 [math.CO] 8 May 2014 Page 1 arXiv:1405.2064v1 [math.CO] 8 May 2014
On Permutations Avoiding the Dashed Patterns 32-41 and 41-32 David Callan Department of
Statistics, University of Wisconsin-Madison, Madison, WI 53706 [email protected] May 7,
2014 Abstract We show that permutations of size n avoiding both of the dashed patterns 32-41
and 41-32 are equinumerous with indecomposable set partitions of size n + 1, and deduce a
related result. 1 Introduction Permutations avoiding one or two 4-letter (classical) patterns have�…
On Permutations Avoiding the Dashed Patterns 32-41 and 41-32 David Callan Department of
Statistics, University of Wisconsin-Madison, Madison, WI 53706 [email protected] May 7,
2014 Abstract We show that permutations of size n avoiding both of the dashed patterns 32-41
and 41-32 are equinumerous with indecomposable set partitions of size n + 1, and deduce a
related result. 1 Introduction Permutations avoiding one or two 4-letter (classical) patterns have�…
We show that permutations of size avoiding both of the dashed patterns 32-41 and 41-32 are equinumerous with indecomposable set partitions of size , and deduce a related result.
arxiv.org