Back to search

Georgia Southern University

Enumeration of Lattice Paths with Restrictions

Abstract

dc:description.abstract

Lattice path enumeration, through the lens of Catalan numbers, plays a crucial role in combinatorics. This thesis delves into enumerations of some of the most common lattice paths – north-east paths, up-down paths, and Dyck paths – with restrictions applied. The first restriction is counting north-east lattice paths that only cross the diagonal line, y=x, once. The second form of lattice paths with restrictions is up-down paths that cross the x-axis exactly once and fall to a fixed depth of k. While working through this module, a novel proof for a known integer sequence was used, then applied to generate a formula to produce a new sequence. These results are demonstrated through visual examples and rigorous proofs, utilizing mathematical induction. This exploration provides a comprehensive understanding of the Catalan numbers and their applications in enumerating restricted lattice paths, laying the groundwork for further combinatorial investigations.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Mathematics (M.S.)
Level thesis:degree_level
Thesis (open access)
Discipline thesis:degree_discipline
Department of Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • White, Vince
Contributors dc:contributor
  • Andrew Sills
  • Daniel Gray

Subjects

dc:subject × 5

Rights

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.georgiasouthern.edu/etd/2799

Chain of custody

source
Harvested from
Georgia Southern University
Base URL
digitalcommons.georgiasouthern.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

White, Vince. Enumeration of Lattice Paths with Restrictions. Thesis (open access) thesis, https://digitalcommons.georgiasouthern.edu/etd/2799