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\"{o}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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.