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

TL;DR
This paper establishes a combinatorial equivalence between permutations avoiding specific dashed patterns and indecomposable set partitions, revealing new connections in permutation pattern avoidance.
Contribution
It introduces a novel bijection linking pattern-avoiding permutations to indecomposable set partitions, expanding understanding of permutation pattern classes.
Findings
Permutations avoiding 32-41 and 41-32 are equinumerous with indecomposable set partitions.
A related combinatorial result is deduced from this equivalence.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Coding theory and cryptography · graph theory and CDMA systems
