Unimodality and Dyck paths

MaRDI QIDQ5401054zbMATH OpenFDO

Authors L. Ferrari

Publication date 12 March 2014

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

zbMATH Keywords

Dyck pathsaturated chainunimodality

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Abstract: We propose an original approach to the problem of rankunimodality for Dyck lattices. It is based on a well known recursive construction of Dyck paths originally developed in the context of the ECO methodology, which provides a partition of Dyck lattices into saturated chains. Even if we are not able to prove that Dyck lattices are rank-unimodal, we describe a family of polynomials (which constitutes a polynomial analog of ballot numbers) and a succession rule which appear to be useful in addressing such a problem. At the end of the paper, we also propose and begin a systematic investigation of the problem of unimodality of succession rules.

Recommendations

• Log concavity of a sequence in a conjecture of Simion
• Unimodality and the reflection principle
• Unimodality of certain sequences connected with binomial coefficients
• Pattern-avoiding Dyck paths
• Proof of a conjecture on unimodality

Cited in

(5)

• Dyson's crank and unimodal compositions
• A Heyting algebra on Dyck paths of type A and B
• Unimodality and coloured hook factorisation
• Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
• Interlacing property of a family of generating polynomials over Dyck paths

This page was built for publication: Unimodality and Dyck paths

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