001433069 000__ 03359cam\a2200553\i\4500
001433069 001__ 1433069
001433069 003__ OCoLC
001433069 005__ 20230309003547.0
001433069 006__ m\\\\\o\\d\\\\\\\\
001433069 007__ cr\cn\nnnunnun
001433069 008__ 201226s2021\\\\sz\\\\\\ob\\\\000\0\eng\d
001433069 019__ $$a1228030598$$a1228115454$$a1228641211$$a1237463351
001433069 020__ $$a9783030670801$$q(electronic bk.)
001433069 020__ $$a3030670805$$q(electronic bk.)
001433069 020__ $$z3030670791
001433069 020__ $$z9783030670795
001433069 0247_ $$a10.1007/978-3-030-67080-1$$2doi
001433069 035__ $$aSP(OCoLC)1228039895
001433069 040__ $$aEBLCP$$beng$$erda$$epn$$cEBLCP$$dYDX$$dGW5XE$$dSFB$$dOCLCO$$dOCLCF$$dOCL$$dOCLCQ$$dOCLCO$$dCOM$$dOCLCQ
001433069 049__ $$aISEA
001433069 050_4 $$aQA164
001433069 08204 $$a511/.6$$223
001433069 1001_ $$aMelczer, Stephen,$$eauthor.
001433069 24513 $$aAn invitation to analytic combinatorics in several variables :$$bfrom one to several variables /$$cStephen Melczer.
001433069 2463_ $$aAlgorithmic and symbolic combinatorics :$$ban invitation to analytic combinatorics in several variables
001433069 264_1 $$aCham :$$bSpringer,$$c[2021]
001433069 300__ $$a1 online resource (426 pages)
001433069 336__ $$atext$$btxt$$2rdacontent
001433069 337__ $$acomputer$$bc$$2rdamedia
001433069 338__ $$aonline resource$$bcr$$2rdacarrier
001433069 4901_ $$aTexts & monographs in symbolic computation
001433069 504__ $$aIncludes bibliographical references.
001433069 5050_ $$aIntroduction -- Background and Motivation -- Smooth ACSV and Applications -- Non-Smooth ACSV.
001433069 506__ $$aAccess limited to authorized users.
001433069 520__ $$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.
001433069 588__ $$aDescription based on print version record.
001433069 650_0 $$aCombinatorial analysis.
001433069 650_0 $$aComputable functions.
001433069 650_6 $$aAnalyse combinatoire.
001433069 650_6 $$aFonctions calculables.
001433069 655_0 $$aElectronic books.
001433069 77608 $$iPrint version:$$aMelczer, Stephen.$$tAlgorithmic and Symbolic Combinatorics.$$dCham : Springer International Publishing AG, ©2021$$z9783030670795
001433069 830_0 $$aTexts and monographs in symbolic computation.
001433069 852__ $$bebk
001433069 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-67080-1$$zOnline Access$$91397441.1
001433069 909CO $$ooai:library.usi.edu:1433069$$pGLOBAL_SET
001433069 980__ $$aBIB
001433069 980__ $$aEBOOK
001433069 982__ $$aEbook
001433069 983__ $$aOnline
001433069 994__ $$a92$$bISE