東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

An invitation to analytic combinator...

Melczer, Stephen.

FindBook

Google Book

Amazon

博客來

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 /
其他題名:	Algorithmic and symbolic combinatorics :
作者:	Melczer, Stephen.
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xviii, 418 p. :ill., digital ;24 cm.
內容註:	Introduction -- Background and Motivation -- Smooth ACSV and Applications -- Non-Smooth ACSV.
Contained By:	Springer Nature eBook
標題:	Combinatorial analysis. -
電子資源:	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] :Algorithmic and symbolic combinatorics :an invitation to analytic combinatorics in several variablesby Stephen Melczer. - Cham :Springer International Publishing :2021. - xviii, 418 p. :ill., digital ;24 cm. - Texts & monographs in symbolic computation. - Texts & monographs in symbolic computation..

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:

523878
Combinatorial analysis.

LC Class. No.: QA164

Dewey Class. No.: 511.6

An invitation to analytic combinatorics = from one to several variables /
LDR:02403nmm a2200349 a 4500 001 2236767
003 DE-He213
005 20201222212328.0
006 m d
007 cr nn 008maaau
008 211111s2021 sz s 0 eng d
020 $a 9783030670801 $q (electronic bk.)
020 $a 9783030670795 $q (paper)
024 7 $a 10.1007/978-3-030-67080-1 $2 doi
035 $a 978-3-030-67080-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164
072 7 $a PBD $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBD $2 thema
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .M518 2021
100 1 $a Melczer, Stephen. $3 3488441
245 1 0 $a An invitation to analytic combinatorics $h [electronic resource] : $b from one to several variables / $c by Stephen Melczer.
246 3 $a Algorithmic and symbolic combinatorics : $b an invitation to analytic combinatorics in several variables
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xviii, 418 p. : $b ill., digital ; $c 24 cm.
490 1 $a Texts & monographs in symbolic computation
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 0 $a Combinatorial analysis. $3 523878
650 0 $a Computable functions. $3 559829
650 1 4 $a Discrete Mathematics. $3 1569938
650 2 4 $a Symbolic and Algebraic Manipulation. $3 891222
650 2 4 $a Mathematical Methods in Physics. $3 890898
650 2 4 $a Algorithms. $3 536374
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Texts & monographs in symbolic computation. $3 2156374
856 4 0 $u https://doi.org/10.1007/978-3-030-67080-1
950 $a Computer Science (SpringerNature-11645)