Enumerative combinatorics of intervals in the Dyck pattern poset

Antonio Bernini, Matteo Cervetti, Luca Ferrari*, Einar Steingrímsson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
17 Downloads (Pure)

Abstract

We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations. In most of the cases, we are also able to refine our formulas by rank. We also provide the first results on the Möbius function of the Dyck pattern poset, giving for instance a closed expression for the Möbius function of initial intervals whose maximum is a Dyck path having exactly two peaks.

Original languageEnglish
Pages (from-to)473-487
Number of pages15
JournalOrder
Volume38
Issue number3
Early online date3 Apr 2021
DOIs
Publication statusPublished - 31 Oct 2021

Funding

A.B. and L.F. are members of the INdAM Research group GNCS; they are partially supported by INdAM -GNCS 2019 project “Studio di proprietá combinatoriche di linguaggi formali ispirate dalla biologia e da strutture bidimensionali” and by a grant of the “Fondazione della Cassa di Risparmio di Firenze” for the project “Rilevamento di pattern: applicazioni a memorizzazione basata sul DNA, evoluzione del genoma, scelta sociale” E. S. is partially supported by a Leverhulme Research Fellowship.

Keywords

  • Dyck path
  • enumeration
  • interval
  • Möbius function
  • poset

Fingerprint

Dive into the research topics of 'Enumerative combinatorics of intervals in the Dyck pattern poset'. Together they form a unique fingerprint.

Cite this