Intro; LN-ANHA Series Preface; Preface; Contents; 1 Lattice Paths and Corridors; 1.1 Corridor Paths; 1.2 Corridor Numbers and State Vectors; 1.3 Dyck Paths and Motzkin Paths; 1.4 The Binomial Coefficients and Unbounded Lattices; 1.5 Relationship to Reflection Principle; 1.6 Application: Skewed-Bottom Corridors; 2 One-Dimensional Lattice Walks; 2.1 Reflections and Transitions; 2.2 The Discrete Fourier Transform; 2.3 Computing Vertex Numbers Using the DFT; 2.4 Application: Three-Way Paths; 2.5 Application: Unbounded Corridors; 2.6 Application: Walks in Cycle Graphs
Text of Note
3 Lattice Walks in Higher Dimensions3.1 Multidimensional Corridors; 3.2 Admissibility and Balanced Transition Operators; 3.3 Fourier Analysis of Multidimensional Corridors; 3.4 Walks Within Corridors with Boundary Identifications; 4 Corridor State Space; 4.1 Vertex States as Vectors; 4.2 Using Eigenvectors to Count Corridor Paths; 4.3 Application: Asymptotic Analysis of Centered Corridors; 4.4 Higher Dimensional Centered Corridors; A Review: Complex Numbers; A.1 Properties of the Complex Numbers; A.2 The Complex Exponential; A.3 Complex Vector Spaces; B Triangular Lattices
Text of Note
B.1 Triangular Lattices and Triangle GroupsB. 2 Tilings of the Plane and Corridors; B.3 Application: Walks in Low-Dimensional Wedges; Selected Solutions; References; ; Index