| 书目名称 | Counting Lattice Paths Using Fourier Methods |
| 编辑 | Shaun Ault,Charles Kicey |
| 视频video | |
| 概述 | Introduces a unique technique to count lattice paths by using the discrete Fourier transform.Explores the interconnection between combinatorics and Fourier methods.Motivates students to move from one- |
| 丛书名称 | Applied and Numerical Harmonic Analysis |
| 图书封面 |  |
| 描述 | This monograph introduces a novel and effective approach to counting lattice paths by using the discrete Fourier transform (DFT) as a type of periodic generating function. Utilizing a previously unexplored connection between combinatorics and Fourier analysis, this method will allow readers to move to higher-dimensional lattice path problems with ease. The technique is carefully developed in the first three chapters using the algebraic properties of the DFT, moving from one-dimensional problems to higher dimensions. In the following chapter, the discussion turns to geometric properties of the DFT in order to study the corridor state space. Each chapter poses open-ended questions and exercises to prompt further practice and future research. Two appendices are also provided, which cover complex variables and non-rectangular lattices, thus ensuring the text will be self-contained and serve as a valued reference..Counting Lattice Paths Using Fourier Methods. is ideal for upper-undergraduates and graduate students studying combinatorics or other areas of mathematics, as well as computer science or physics. Instructors will also find this a valuable resource for use in their seminars. Re |
| 出版日期 | Book 2019 |
| 关键词 | Lattice Path; Discrete Fourier Transform; Corridor Numbers; Complex Variables; Combinatorics |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-030-26696-7 |
| isbn_softcover | 978-3-030-26695-0 |
| isbn_ebook | 978-3-030-26696-7Series ISSN 2296-5009 Series E-ISSN 2296-5017 |
| issn_series | 2296-5009 |
| copyright | Springer Nature Switzerland AG 2019 |
发表于 2025-3-21 19:47:45
