Restricted ascent sequences and Catalan numbers

Abstract: Ascent sequences are those consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it and have been shown to be equinumerous with the (2+2)-free posets of the same size. Furthermore, connections to a variety of other combinatorial structures, including set partitions, permutations, and certain integer matrices, have been made. In this paper, we identify all members of the (4,4)-Wilf equivalence class for ascent sequences corresponding to the Catalan number C_n=\frac{1}{n+1}\binom{2n}{n}. This extends recent work concerning avoidance of a single pattern and provides apparently new combinatorial interpretations for C_n. In several cases, the subset of the class consisting of those members having exactly m ascents is given by the Narayana number N_{n,m+1}=\frac{1}{n}\binom{n}{m+1}\binom{n}{m}.