Generalized ballot sequences are ascent sequences

Dukes, Mark (2016) Generalized ballot sequences are ascent sequences. Australasian Journal of Combinatorics, 64 (1). pp. 61-63. ISSN 1034-4942

[img]
Preview
 Text (Dukes-AJOC-2015-Generalized-ballot-sequences-are-ascent)
Dukes_AJOC_2015_Generalized_ballot_sequences_are_ascent.pdf
Accepted Author Manuscript
Download (181kB)| Preview

    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.

    Author(s):Dukes, Mark ORCID: https://orcid.org/0000-0002-2779-2680
    Item type:Article
    ID code:54428
    Keywords:ascent sequences, ballot sequences, Yamanouchi words, Mathematics, Discrete Mathematics and Combinatorics
    Subjects:Science > Mathematics
    Department:Faculty of Science > Computer and Information Sciences
    Depositing user: Pure Administrator
    Date deposited:02 Oct 2015 08:35
    Last modified:19 Jul 2019 02:48
    Related URLs:
    URI:https://strathprints.strath.ac.uk/id/eprint/54428
    Export data:
    CORE (COnnecting REpositories)