29 June 2020 in Discrete Mathematics & Theoretical Computer Science
The enumeration of inversion sequences avoiding a single pattern was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck independently. Their work has sparked various investigations of generalized patterns in inversion sequences, including patterns of relation triples by Martinez and Savage, consecutive patterns by Auli and Elizalde, and vincular patterns by Lin and Yan. In this paper, we carried out the systematic study of inversion sequences avoiding two patterns of length $3$. Our enumerative results establish further connections to the OEIS sequences and some classical combinatorial objects, such as restricted permutations, weighted ordered trees and set partitions. Since patterns of relation triples are some special multiple patterns of length $3$, our results complement the work by Martinez and Savage. In particular, one of their conjectures regarding the enumeration of $(021,120)$-avoiding inversion sequences is solved.
23 August 2021 in Annals of Combinatorics
29 July 2021 in The Ramanujan Journal
10 September 2024 in The Ramanujan Journal
9 May 2024 in Journal of Algebraic Combinatorics
6 December 2019 in Journal of Algebraic Combinatorics