On lattice path enumeration
A lattice path from (a b) to (c d) on the grid Z Z with step set S is a nite sequence of ordered pairs (x0 y0) (x1 y1) : : : (xn yn) on Z Z such that the initial point satisfies (a b) = (x0 y0), the terminal point satisfies (c d) = (xn yn), and the points in between satisfy (xi+1 yi+1) = (xi yi)+ fo...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2019
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18563 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-19076 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-190762022-02-11T05:30:01Z On lattice path enumeration Dionisio, Celine Kim, Junhee A lattice path from (a b) to (c d) on the grid Z Z with step set S is a nite sequence of ordered pairs (x0 y0) (x1 y1) : : : (xn yn) on Z Z such that the initial point satisfies (a b) = (x0 y0), the terminal point satisfies (c d) = (xn yn), and the points in between satisfy (xi+1 yi+1) = (xi yi)+ for some 2 S where we assume that a c and b d. In this paper, we focus on lattice paths from (a b) to (c d) on the grid Z Z with step sets S = f(0 1) (1 0)g and S = f(1 0) (0 1) (1 1)g. We discuss various formulas in counting two-step and three-step lattice paths with various restrictions. This thesis is an exposition of the work of Christian Krattenthaler (2015) on lattice path enumeration. 2019-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/18563 Bachelor's Theses English Animo Repository Mathematics |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
language |
English |
topic |
Mathematics |
spellingShingle |
Mathematics Dionisio, Celine Kim, Junhee On lattice path enumeration |
description |
A lattice path from (a b) to (c d) on the grid Z Z with step set S is a nite sequence of ordered pairs (x0 y0) (x1 y1) : : : (xn yn) on Z Z such that the initial point satisfies (a b) = (x0 y0), the terminal point satisfies (c d) = (xn yn), and the points in between satisfy (xi+1 yi+1) = (xi yi)+ for some 2 S where we assume that a c and b d. In this paper, we focus on lattice paths from (a b) to (c d) on the grid Z Z with step sets S = f(0 1) (1 0)g and S = f(1 0) (0 1) (1 1)g. We discuss various formulas in counting two-step and three-step lattice paths with various restrictions. This thesis is an exposition of the work of Christian Krattenthaler (2015) on lattice path enumeration. |
format |
text |
author |
Dionisio, Celine Kim, Junhee |
author_facet |
Dionisio, Celine Kim, Junhee |
author_sort |
Dionisio, Celine |
title |
On lattice path enumeration |
title_short |
On lattice path enumeration |
title_full |
On lattice path enumeration |
title_fullStr |
On lattice path enumeration |
title_full_unstemmed |
On lattice path enumeration |
title_sort |
on lattice path enumeration |
publisher |
Animo Repository |
publishDate |
2019 |
url |
https://animorepository.dlsu.edu.ph/etd_bachelors/18563 |
_version_ |
1772835099414364160 |