Papers
Topics
Authors
Recent
Search
2000 character limit reached

On 102-avoiding inversion sequences

Published 3 Jun 2025 in math.CO | (2506.02985v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.