Skip to main navigation Skip to search Skip to main content

Simultaneous avoidance of length-4 patterns in ascent sequences

  • Qi Liu
  • , Sergey Kitaev*
  • , Philip B. Zhang
  • *Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

Ascent sequences form a central class of combinatorial objects, as they are in bijection with several important families such as (2+2)-free posets, Stoimenow matchings, and other Fishburn objects, and are enumerated by the Fishburn numbers. We study pattern avoidance in ascent sequences for the five patterns of length 4: 0101, 0102, 0112, 0120, and 0121. These patterns arise naturally from recent work on pattern avoidance in related families of Fishburn objects, including Stoimenow matchings and (2+2)-free posets. We enumerate ascent sequences avoiding all nonempty subsets of these patterns, with the exception of the sets {0120}, {0121}, and {0120, 0121}, for which the enumeration remains open. Our results reveal that the corresponding avoidance classes fall into 16 Wilf equivalence classes and exhibit a wide range of enumerative behavior, including connections to classical sequences such as the Catalan and Fibonacci numbers, as well as polynomial formulas and rational generating functions; several of the sequences we obtain appear to be new. Our methods combine structural decompositions with generating-tree techniques and, in several cases, rely on reductions to shorter patterns via restricted growth functions. This work contributes to the broader study of pattern avoidance across Fishburn families and highlights further connections between ascent sequences and other combinatorial structures
Original languageEnglish
Article number18
JournalDiscrete Mathematics and Theoretical Computer Science
Volume28
Issue number3
DOIs
Publication statusPublished - 20 Oct 2026

Funding

The work of Philip B. Zhang was supported by the Natural Science Foundation of Tianjin Municipal (No. 25JCYBJC00430).

Keywords

  • ascent sequence
  • pattern avoidance
  • permutations
  • words
  • matrices
  • exact enumeration problems
  • generating functions

Fingerprint

Dive into the research topics of 'Simultaneous avoidance of length-4 patterns in ascent sequences'. Together they form a unique fingerprint.

Cite this