The Dyck pattern poset

From MaRDI portal
Publication:394536

DOI10.1016/J.DISC.2013.12.011zbMATH Open1281.05009arXiv1303.3785OpenAlexW2086582845MaRDI QIDQ394536FDOQ394536


Authors: Axel Bacher, Antonio Bernini, L. Ferrari, Benjamin Gunby, Julian West, R. Pinzani Edit this on Wikidata


Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P, we determine a formula for the number of Dyck paths covered by P, as well as for the number of Dyck paths covering P. We then address some typical pattern-avoidance issues, enumerating some classes of pattern-avoiding Dyck paths. Finally, we offer a conjecture concerning the asymptotic behavior of the sequence counting Dyck paths avoiding a generic pattern and we pose a series of open problems regarding the structure of the Dyck pattern poset.


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




Recommendations




Cites Work


Cited In (29)

Uses Software





This page was built for publication: The Dyck pattern poset

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