Generalized ballot sequences are ascent sequences

Mark Dukes

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.
LanguageEnglish
Pages61-63
Number of pages3
JournalAustralasian Journal of Combinatorics
Volume64
Issue number1
Publication statusPublished - 2016

Fingerprint

Ascent
Permutation
Correspondence

Keywords

  • ascent sequences
  • ballot sequences
  • Yamanouchi words

Cite this

@article{82953e4605764009a68eee3ea1432085,
title = "Generalized ballot sequences are ascent sequences",
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.",
keywords = "ascent sequences, ballot sequences, Yamanouchi words",
author = "Mark Dukes",
year = "2016",
language = "English",
volume = "64",
pages = "61--63",
journal = "Australasian Journal of Combinatorics",
issn = "1034-4942",
publisher = "University of Queensland Press",
number = "1",

}

Generalized ballot sequences are ascent sequences. / Dukes, Mark.

In: Australasian Journal of Combinatorics, Vol. 64, No. 1, 2016, p. 61-63.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Generalized ballot sequences are ascent sequences

AU - Dukes, Mark

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - ascent sequences

KW - ballot sequences

KW - Yamanouchi words

UR - http://ajc.maths.uq.edu.au/

M3 - Article

VL - 64

SP - 61

EP - 63

JO - Australasian Journal of Combinatorics

T2 - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

SN - 1034-4942

IS - 1

ER -