Authors:
- 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-dimensional problems to higher dimensions
- Presents numerous exercises with selected solutions appearing at the end
Part of the book series: Applied and Numerical Harmonic Analysis (ANHA)
Part of the book sub series: Lecture Notes in Applied and Numerical Harmonic Analysis (LN-ANHA)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (4 chapters)
-
Front Matter
-
Back Matter
About this book
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. Readers should have a firm understanding of calculus, including integration, sequences, and series, as well as a familiarity with proofs and elementary linear algebra.
Authors and Affiliations
-
Department of Mathematics, Valdosta State University, Valdosta, USA
Shaun Ault, Charles Kicey
Bibliographic Information
Book Title: Counting Lattice Paths Using Fourier Methods
Authors: Shaun Ault, Charles Kicey
Series Title: Applied and Numerical Harmonic Analysis
DOI: https://doi.org/10.1007/978-3-030-26696-7
Publisher: Birkhäuser Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Nature Switzerland AG 2019
Softcover ISBN: 978-3-030-26695-0Published: 31 August 2019
eBook ISBN: 978-3-030-26696-7Published: 30 August 2019
Series ISSN: 2296-5009
Series E-ISSN: 2296-5017
Edition Number: 1
Number of Pages: XII, 136
Number of Illustrations: 59 b/w illustrations, 1 illustrations in colour
Topics: Fourier Analysis, Abstract Harmonic Analysis, Combinatorics