Three classes of inversion sequences counted by large Schröder numbers

David Callan, Toufik Mansour

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, analytically and combinatorially, we reprove that the number of inversion sequences that avoid {100, 101, 201, 210} (respec-tively, {100, 110, 201, 210}) is given by the large Schröder number, as shown by Martinez and Savage. Moreover, we show that the number of inversion sequences that avoid {101, 110, 201, 210} is also given by the large Schröder number.

Original languageEnglish
Pages (from-to)391-402
Number of pages12
JournalAustralasian Journal of Combinatorics
Volume87
Issue number3
StatePublished - Oct 2023

Bibliographical note

Publisher Copyright:
© The author(s).

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Three classes of inversion sequences counted by large Schröder numbers'. Together they form a unique fingerprint.

Cite this