Enumerating the Constrained Lattice Paths
碩士 === 國立中興大學 === 電機工程學系所 === 102 === Enumerating the total number of constrained lattice paths is a well- established subject in combinatorics and constitutes a crucial research topic in academia. Although the architecture of lattice paths is easily understood, most proposed theorems have not yet b...
Main Authors: | Yu-Ming Chen, 陳友明 |
---|---|
Other Authors: | Shun-Pin Hsu |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/34157461361659361301 |
Similar Items
- The enumeration of lattice paths and walks
-
Generating functions and the enumeration of lattice paths
by: Mutengwe, Phumudzo Hector
Published: (2013) -
Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration
by: Melczer, Stephen
Published: (2017) -
Enumeration problems on lattices
by: Ocansey, Evans Doe
Published: (2013) -
Toward the Enumeration of Maximal Chains in the Tamari Lattices
Published: (2016)