On Refinements of Wilf-Equivalence for Involutions
Sherry H.F. Yan, Lintong Wang, Robin D.P. Zhou

TL;DR
This paper establishes a peak set preserving bijection between certain pattern-avoiding involutions, refining previous results and confirming conjectures about alternating involutions, using combinatorial structures like Dyck paths and tableaux.
Contribution
It introduces a new bijection that refines earlier work on involution pattern avoidance, specifically for the case when k=3, and proves conjectures related to alternating involutions.
Findings
Bijection between 123 and 321 pattern-avoiding involutions preserving peak sets.
Confirmed conjectures on the equality of pattern-avoiding alternating involutions.
Extended pattern avoidance results to new classes of involutions and structures.
Abstract
Let (resp. and ) denote the set of permutations (resp. involutions and alternating involutions) of length which avoid the permutation pattern . For , Backelin-West-Xin proved that by establishing a bijection between these two sets, where is an arbitrary permutation of . The result has been extended to involutions by Bousquet-M\'elou and Steingr\'imsson and to alternating permutations by the first author. In this paper, we shall establish a peak set preserving bijection between and via transversals, matchings, oscillating tableaux and pairs of noncrossing Dyck paths as intermediate structures. Our result is a refinement of the result of…
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 · Botanical Research and Chemistry · Advanced Mathematical Identities
