Restricted ascent sequences and Catalan numbers

From MaRDI portal
Publication:2815239

DOI10.2298/AADM140626007CzbMATH Open1349.05009arXiv1403.6933OpenAlexW2963750081MaRDI QIDQ2815239FDOQ2815239


Authors: David Callan, Toufik Mansour, Mark Shattuck Edit this on Wikidata


Publication date: 27 June 2016

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

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}�inom{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}�inom{n}{m+1}�inom{n}{m}.


Full work available at URL: https://arxiv.org/abs/1403.6933




Recommendations





Cited In (6)





This page was built for publication: Restricted ascent sequences and Catalan numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815239)