2000 character limit reached
On permutations avoiding the dashed patterns 32-41 and 41-32
Published 8 May 2014 in math.CO | (1405.2064v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.