國立虎尾科技大學 |

An Invitation to Analytic Combinatorics = From One to Several Variables /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	An Invitation to Analytic Combinatorics/ by Stephen Melczer.
其他題名:	From One to Several Variables /
作者:	Melczer, Stephen.
面頁冊數:	XVIII, 418 p. 45 illus., 36 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical Methods in Physics. -
電子資源:	https://doi.org/10.1007/978-3-030-67080-1
ISBN:	9783030670801

An Invitation to Analytic Combinatorics = From One to Several Variables /
Melczer, Stephen.

An Invitation to Analytic CombinatoricsFrom One to Several Variables /[electronic resource] :by Stephen Melczer. - 1st ed. 2021. - XVIII, 418 p. 45 illus., 36 illus. in color.online resource. - Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,2197-8409. - Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,.

Introduction -- Background and Motivation -- Smooth ACSV and Applications -- Non-Smooth ACSV.

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

ISBN: 9783030670801

Standard No.: 10.1007/978-3-030-67080-1doiSubjects--Topical Terms:

670749
Mathematical Methods in Physics.

LC Class. No.: QA150-272

Dewey Class. No.: 511.1

An Invitation to Analytic Combinatorics = From One to Several Variables /
LDR:02786nam a22004095i 4500 001 1051003
003 DE-He213
005 20210818074609.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030670801 $9 978-3-030-67080-1
024 7 $a 10.1007/978-3-030-67080-1 $2 doi
035 $a 978-3-030-67080-1
050 4 $a QA150-272
072 7 $a PBD $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBD $2 thema
082 0 4 $a 511.1 $2 23
100 1 $a Melczer, Stephen. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1355455
245 1 3 $a An Invitation to Analytic Combinatorics $h [electronic resource] : $b From One to Several Variables / $c by Stephen Melczer.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVIII, 418 p. 45 illus., 36 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 Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, $x 2197-8409
505 0 $a Introduction -- Background and Motivation -- Smooth ACSV and Applications -- Non-Smooth ACSV.
520 $a This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.
650 2 4 $a Mathematical Methods in Physics. $3 670749
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 1 4 $a Discrete Mathematics. $3 796600
650 0 $a Algorithms. $3 527865
650 0 $a Physics. $3 564049
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Discrete mathematics. $3 1254302
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030670795
776 0 8 $i Printed edition: $z 9783030670818
776 0 8 $i Printed edition: $z 9783030670825
830 0 $a Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, $x 0943-853X $3 1256871
856 4 0 $u https://doi.org/10.1007/978-3-030-67080-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)