國立虎尾科技大學 |

Counting Lattice Paths Using Fourier Methods

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Counting Lattice Paths Using Fourier Methods/ by Shaun Ault, Charles Kicey.
作者:	Ault, Shaun.
其他作者:	Kicey, Charles.
面頁冊數:	XII, 136 p. 60 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Fourier analysis. -
電子資源:	https://doi.org/10.1007/978-3-030-26696-7
ISBN:	9783030266967

Counting Lattice Paths Using Fourier Methods
Ault, Shaun.

Counting Lattice Paths Using Fourier Methods[electronic resource] /by Shaun Ault, Charles Kicey. - 1st ed. 2019. - XII, 136 p. 60 illus., 1 illus. in color.online resource. - Lecture Notes in Applied and Numerical Harmonic Analysis,2512-6482. - Lecture Notes in Applied and Numerical Harmonic Analysis,.

Lattice Paths and Corridors -- One-Dimensional Lattice Walks -- Lattice Walks in Higher Dimensions -- Corridor State Space -- Review: Complex Numbers -- Triangular Lattices -- Selected Solutions -- Index.

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. Readers should have a firm understanding of calculus, including integration, sequences, and series, as well as a familiarity with proofs and elementary linear algebra.

ISBN: 9783030266967

Standard No.: 10.1007/978-3-030-26696-7doiSubjects--Topical Terms:

639284
Fourier analysis.

LC Class. No.: QA403.5-404.5

Dewey Class. No.: 515.2433

Counting Lattice Paths Using Fourier Methods
LDR:02979nam a22003975i 4500 001 1012419
003 DE-He213
005 20200704084655.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030266967 $9 978-3-030-26696-7
024 7 $a 10.1007/978-3-030-26696-7 $2 doi
035 $a 978-3-030-26696-7
050 4 $a QA403.5-404.5
072 7 $a PBKF $2 bicssc
072 7 $a MAT034000 $2 bisacsh
072 7 $a PBKF $2 thema
082 0 4 $a 515.2433 $2 23
100 1 $a Ault, Shaun. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1306664
245 1 0 $a Counting Lattice Paths Using Fourier Methods $h [electronic resource] / $c by Shaun Ault, Charles Kicey.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Birkhäuser, $c 2019.
300 $a XII, 136 p. 60 illus., 1 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Applied and Numerical Harmonic Analysis, $x 2512-6482
505 0 $a Lattice Paths and Corridors -- One-Dimensional Lattice Walks -- Lattice Walks in Higher Dimensions -- Corridor State Space -- Review: Complex Numbers -- Triangular Lattices -- Selected Solutions -- Index.
520 $a 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. Readers should have a firm understanding of calculus, including integration, sequences, and series, as well as a familiarity with proofs and elementary linear algebra.
650 0 $a Fourier analysis. $3 639284
650 0 $a Harmonic analysis. $3 672073
650 0 $a Combinatorics. $3 669353
650 1 4 $a Fourier Analysis. $3 672627
650 2 4 $a Abstract Harmonic Analysis. $3 672075
700 1 $a Kicey, Charles. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1306665
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030266950
776 0 8 $i Printed edition: $z 9783030266974
830 0 $a Lecture Notes in Applied and Numerical Harmonic Analysis, $x 2512-6482 $3 1264855
856 4 0 $u https://doi.org/10.1007/978-3-030-26696-7
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)