On 102-Avoiding Inversion Sequences
Abstract
In this article, we provide a bijection between the set of inversion sequences avoiding the pattern 102 and the set of 2-Schröder paths having neither peaks nor valleys and ending with a diagonal step. To achieve this, we introduce two intermediate objects, called UVD paths and labeled $F$-paths, and establish bijections among all four families. For each of these combinatorial objects, we define a natural statistic and enumerate the corresponding structures with respect to this statistic. In addition, we study inversion sequences avoiding 102 and another pattern of length 3, providing refined enumerations according to the same statistic.
Fields of Study & Subjects
semigroups and automata theory
graph theory and CDMA systems
Coding theory and cryptography
Publication details
- Journal / source
- The Electronic Journal of Combinatorics
- Volume
- 33
- Issue
- 2
- Publication date
- 14 April 2026
- Language
- EN