Picture map of Europe with pins indicating European capital cities

Open Access research with a European policy impact...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by Strathclyde researchers, including by researchers from the European Policies Research Centre (EPRC).

EPRC is a leading institute in Europe for comparative research on public policy, with a particular focus on regional development policies. Spanning 30 European countries, EPRC research programmes have a strong emphasis on applied research and knowledge exchange, including the provision of policy advice to EU institutions and national and sub-national government authorities throughout Europe.

Explore research outputs by the European Policies Research Centre...

A note on p-Ascent Sequences

Kitaev, Sergey and Remmel, Jeffrey (2017) A note on p-Ascent Sequences. Journal of Combinatorics, 8 (3). pp. 487-506. ISSN 2156-3527

Text (Kitaev-Remmel-JC2016-a-note-on-p-ascent-sequences)
Kitaev_Remmel_JC2016_a_note_on_p_ascent_sequences.pdf - Accepted Author Manuscript

Download (117kB) | Preview


Ascent sequences were introduced by Bousquet-Mélou, Claesson, Dukes, and Kitaev in [1], who showed that ascent sequences of length n are in 1-to-1 correspondence with (2+2)-free posets of size n. In this paper, we introduce a generalization of ascent sequences, which we call p-ascent sequences, where p \geq 1. A sequence $(a_1, \ldots, a_n)$ of non-negative integers is a p-ascent sequence if $a_0 =0$ and for all $i \geq 2$, $a_i$ is at most p plus the number of ascents in $(a_1, \ldots, a_{i-1})$. Thus, in our terminology, ascent sequences are 1-ascent sequences. We generalize a result of the authors in [9] by enumerating p-ascent sequences with respect to the number of 0s. We also generalize a result of Dukes, Kitaev, Remmel, and Steingrímsson in [4] by finding the generating function for the number of p-ascent sequences which have no consecutive repeated elements. Finally, we initiate the study of pattern-avoiding p-ascent sequences.