ASCENT SEQUENCES AND WEAK ASCENT SEQUENCES AVOIDING A QUADRUPLE OF LENGTH-3 PATTERNS

David Callan, Toufik Mansour

Research output: Contribution to journalArticlepeer-review

Abstract

We say that two sets of patterns B and C are A-Wilf-equivalent if the number of ascent sequences of length n that avoid all the patterns in B equals the number of ascent sequences of length n that avoid all the patterns in C, for all n ≥ 0. Similarly, WA-Wilf-equivalence refers to weak ascent sequences. Here, we show that the number of A-Wilf-equivalence classes among quadruples of length-3 patterns is 74 and the number of WA-Wilf-equivalence classes among quadruples of length-3 patterns is either 228 or 229. The main tool is generating trees; bijective methods are also sometimes used.

Original languageEnglish
Article numberA80
JournalIntegers
Volume25
DOIs
StatePublished - 2025

Bibliographical note

Publisher Copyright:
© 2025, Colgate University. All rights reserved.

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'ASCENT SEQUENCES AND WEAK ASCENT SEQUENCES AVOIDING A QUADRUPLE OF LENGTH-3 PATTERNS'. Together they form a unique fingerprint.

Cite this