On Delannoy paths without peaks and valleys

Abstract: A lattice path is called emph{Delannoy} if its every step belongs to

l e f t N, E, D i g h t

, where

N = (0, 1)

,

E = (1, 0)

, and

D = (1, 1)

steps. emph{Peak}, emph{valley}, and emph{deep valley} mean

N E

,

E N

, and

E E N N

on the lattice path, respectively. In this paper, we find a bijection between

m a t h c a l P_{n, m} (N E, E N)

and a specific subset of

m a t h c a l P_{n, m} (D, E E N N)

, where

m a t h c a l P_{n, m} (N E, E N)

is the set of Delannoy paths from the origin to the points

(n, m)

without peaks and valleys and

m a t h c a l P_{n, m} (D, E E N N)

is the set of Delannoy lattice paths from the origin to the points

(n, m)

without diagonal steps and deep valleys. We also enumerate the number of Delannoy paths without peaks and valleys on the restricted region

l e f t (x, y) i n m a t h b b Z^{2} : y g e k x i g h t

for a positive integer

k

.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: On Delannoy paths without peaks and valleys