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

preprint2016arXivOpen access

Abstract

A dispersed Dyck path (DDP) of length n is a lattice path on N×NN\times N from (0,0) to (n,0) in which the following steps are allowed: "up" (x, y) →\to (x+1, y+1); "down" (x, y) →\to (x+1, y-1); and "right" (x,0) →\to (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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.