A bijection between 321- and 213-avoiding permutations preserving t-stack-sortability

Tools

Li, Yang and Kitaev, Sergey and Lin, Zhicong and Liu, Jing (2026) A bijection between 321- and 213-avoiding permutations preserving t-stack-sortability. Annals of Combinatorics. ISSN 0218-0006 (In Press)

[thumbnail of Li-etal-AC-2026-A-bijection-between-321-and-213-avoiding-permutations] Text. Filename: Li-etal-AC-2026-A-bijection-between-321-and-213-avoiding-permutations.pdf
Accepted Author Manuscript
Restricted to Repository staff only until 1 January 2099.
Download (500kB) | Request a copy

Abstract

We construct a bijection between 321- and 213-avoiding permutations that preserves the property of t-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of an enumerative conjecture posed by Zhang and Kitaev. This work contributes further to the long-standing line of research on bijections between length-3 pattern avoiding permutations. Increasing binary trees lie at the heart of our approach.

ORCID iDs

Li, Yang, Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647, Lin, Zhicong and Liu, Jing;
CORE (COnnecting REpositories)