Short note on the number of 1-ascents in dispersed Dyck paths

DOI10.1142/S179383091750077XMaRDI QIDQ4597962zbMATH OpenOpenAlexFDO

Authors Kairi Kangro, Mozhgan Pourmoradnasseri, Dirk Oliver Theis

Publication date 14 December 2017

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Dyck pathslattice path statistics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Calculation of integer sequences (11Y55) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Abstract: A dispersed Dyck path (DDP) of length n is a lattice path on $NimesN$ from (0,0) to (n,0) in which the following steps are allowed: "up" (x, y) $o$ (x+1, y+1); "down" (x, y) $o$ (x+1, y-1); and "right" (x,0) $o$ (x+1,0). An ascent in a DDP is an inclusion-wise maximal sequence of consecutive up steps. A 1-ascent is an ascent consisting of exactly 1 up step. We give a closed formula for the total number of 1-ascents in all dispersed Dyck paths of length n, A191386 in Sloane's OEIS. Previously, only implicit generating function relations and asymptotics were known.

Recommendations

• Counting ascents in generalized Dyck paths
• Dyck paths with coloured ascents
• Statistics on Dyck paths
• Some strings in Dyck paths
• Enumerating symmetric and asymmetric peaks in Dyck paths

Cited in

(2)

• Dispersed Dyck paths revisited
• Generic complex polynomial vector fields with real coefficients

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Short note on the number of 1-ascents in dispersed Dyck paths

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