000			03064nam a22004335i 4500
999			_c334686 _d334686 _x1
001			334686
003			ES-MaUEC
005			20230102114736.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			201222s2021 gw a s |||| 0|eng d
020			_a9783030670801
024	7		_a10.1007/978-3-030-67080-1 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA164 _b2021 EB
100	1		_aMelczer, Stephen _eautor _4http://id.loc.gov/vocabulary/relators/aut _9678613
245	1	3	_aAn Invitation to Analytic Combinatorics : _bFrom One to Several Variables _cby Stephen Melczer
250			_aFirst edition 2021
264		1	_aCham, Switzerland _bSpringer International Publising _c2021
300			_a1 recurso en línea (XVIII, 418 páginas) _b45 ilustraciones, 36 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_atext file _bPDF _2rda
490	0		_aTexts & Monographs in Symbolic Computation A Series of the Research Institute for Symbolic Computation Johannes Kepler University Linz Austria _x0943-853X
505	0		_aIntroduction -- Background and Motivation -- Smooth ACSV and Applications -- Non-Smooth ACSV.
520	3		_aThis 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.
988			_aSpringer_Computer_2021
650		7	_2embne _aAnálisis combinatorio _9138441
710	2		_aSpringerLink
776	0	8	_iPrinted edition: _z9783030670795
776	0	8	_iPrinted edition: _z9783030670818
776	0	8	_iPrinted edition: _z9783030670825
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-67080-1 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b05/2021 _dz _ek _zSI