On Ascent, Repetition and Descent Sequences
From MaRDI portal
Publication:6328627
arXiv1911.02209MaRDI QIDQ6328627FDOQ6328627
Authors: David Callan 
Publication date: 6 November 2019
Abstract: Ascent sequences have received a lot of attention in recent years in connection with (2 + 2)-free posets and other combinatorial objects. Here, we first show bijectively that analogous repetition sequences are counted by the Bell numbers, and 021-avoiding repetition sequences by the Catalan numbers. Then we adapt a bijection of Chen et al and use it along with the "symbolic" method of Flajolet to find the 4-variable generating function for 021-avoiding ascent sequences by length, number of 0's, number of isolated 0's, and number of runs of 2 or more 0's. We deduce that 021-avoiding ascent sequences that have no consecutive 0's (resp. no isolated 0's) both satisfy a Catalan-like recurrence, differing only in initial conditions, and give a bijective proof for the case of no consecutive 0's. Lastly, we show that 021-avoiding descent sequences are equinumerous with same-size -avoiding Dyck paths.
This page was built for publication: On Ascent, Repetition and Descent Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6328627)
