Generalized ballot sequences are ascent sequences

Mark Dukes

Research output: Contribution to journalArticle

1 Citation (Scopus)
60 Downloads (Pure)

Abstract

Ascent sequences were introduced by the author (in conjunction with others) to encode a class of permutations that avoid a single length- three bivincular pattern, and were the central object through which other combinatorial correspondences were discovered. In this note we prove the non-trivial fact that generalized ballot sequences are ascent sequences.
Original languageEnglish
Pages (from-to)61-63
Number of pages3
JournalAustralasian Journal of Combinatorics
Volume64
Issue number1
Publication statusPublished - 2016

Keywords

  • ascent sequences
  • ballot sequences
  • Yamanouchi words

Cite this