國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Counting lattice paths using Fourier...

Ault, Shaun.

Counting lattice paths using Fourier methods

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Counting lattice paths using Fourier methodsby Shaun Ault, Charles Kicey.
作者:	Ault, Shaun.
其他作者:	Kicey, Charles.
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xii, 136 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Lattice paths.
電子資源:	https://doi.org/10.1007/978-3-030-26696-7
ISBN:	9783030266967$q(electronic bk.)

Counting lattice paths using Fourier methods
Ault, Shaun.

Counting lattice paths using Fourier methods[electronic resource] /by Shaun Ault, Charles Kicey. - Cham :Springer International Publishing :2019. - xii, 136 p. :ill., digital ;24 cm. - Applied and numerical harmonic analysis. - 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$q(electronic bk.)

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

245397
Lattice paths.

LC Class. No.: QA171.5 / .A85 2019

Dewey Class. No.: 511.33

Counting lattice paths using Fourier methods
LDR:02610nmm a2200337 a 4500 001 587208
003 DE-He213
005 20200704084655.0
006 m d
007 cr nn 008maaau
008 210326s2019 sz s 0 eng d
020 $a 9783030266967$q(electronic bk.)
020 $a 9783030266950$q(paper)
024 7 $a 10.1007/978-3-030-26696-7 $2 doi
035 $a 978-3-030-26696-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA171.5 $b .A85 2019
072 7 $a PBKF $2 bicssc
072 7 $a MAT034000 $2 bisacsh
072 7 $a PBKF $2 thema
082 0 4 $a 511.33 $2 23
090 $a QA171.5 $b .A924 2019
100 1 $a Ault, Shaun. $3 878773
245 1 0 $a Counting lattice paths using Fourier methods $h [electronic resource] / $c by Shaun Ault, Charles Kicey.
260 $a Cham : $b Springer International Publishing : $b Imprint: Birkhauser, $c 2019.
300 $a xii, 136 p. : $b ill., digital ; $c 24 cm.
490 1 $a Applied and numerical harmonic analysis
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 Lattice paths. $3 245397
650 0 $a Fourier transformations. $3 184270
650 1 4 $a Fourier Analysis. $3 273776
650 2 4 $a Abstract Harmonic Analysis. $3 274074
650 2 4 $a Combinatorics. $3 274788
700 1 $a Kicey, Charles. $3 878774
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Applied and numerical harmonic analysis. $3 558836
856 4 0 $u https://doi.org/10.1007/978-3-030-26696-7
950 $a Mathematics and Statistics (SpringerNature-11649)