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.
|Number of pages||3|
|Journal||Australasian Journal of Combinatorics|
|Publication status||Published - 2016|
- ascent sequences
- ballot sequences
- Yamanouchi words