### Abstract

Let script D sign_{0}(n) denote the set of lattice paths in the xy-plane that begin at (0,0), terminate at (n,n), never rise above the line y = x and have step set script S sign = {(k,0):k∈ℕ ^{+}}∪{(0,k):k∈ℕ^{+}}. Let ℰ_{0}(n) denote the set of lattice paths with step set script S sign that begin at (0,0) and terminate at (n,n). Using primarily the symbolic method (R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996) and the Lagrange inversion formula we study some enumerative problems associated with script D sign_{0}(n) and ℰ_{0}(n).

Original language | English (US) |
---|---|

Pages (from-to) | 13-28 |

Number of pages | 16 |

Journal | Discrete Mathematics |

Volume | 271 |

Issue number | 1-3 |

DOIs | |

State | Published - Sep 28 2003 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Enumerating a class of lattice paths'. Together they form a unique fingerprint.

## Cite this

Coker, C. C. (2003). Enumerating a class of lattice paths.

*Discrete Mathematics*,*271*(1-3), 13-28. https://doi.org/10.1016/S0012-365X(03)00037-2