04089nam 2200841Ia 450 991096604060332120250411144802.097866120016599781107202023110720202797805114799910511479999978128200165712820016559780511480799051148079297805114775910511477597978051147614305114761409780511801655051180165397805114791130511479115(CKB)1000000000702613(EBL)412737(OCoLC)437089878(SSID)ssj0000103004(PQKBManifestationID)11132811(PQKBTitleCode)TC0000103004(PQKBWorkID)10061422(PQKB)11383120(UkCbUP)CR9780511801655(WaSeSS)IndRDA00019027(Au-PeEL)EBL412737(CaPaEBR)ebr10277515(CaONFJC)MIL200165(MiAaPQ)EBC412737(PPN)261361570(EXLCZ)99100000000070261320080901d2009 uy 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierAnalytic combinatorics /Philippe Flajolet & Robert Sedgewick1st ed.Cambridge ;New York Cambridge University Press20091 online resource (xiii, 810 pages) digital, PDF file(s)Title from publisher's bibliographic system (viewed on 05 Oct 2015).9781139637848 1139637843 9780521898065 0521898064 Includes bibliographical references (p. 779-800) and index.Symbolic methods -- Combinatorial structures and ordinary generating functions -- Labelled structures and exponential generating functions -- Combinatorial parameters and multivariate generating functions -- Complex asymptotics -- Complex analysis, rational and meromorphic asymptotics -- Applications of rational and meromorphic asymptotics -- Singularity analysis of generating functions -- Applications of singularity analysis -- Saddle-point asymptotics -- Random structures -- Multivariate asymptotics and limit laws -- Appendix A : Auxiliary elementary notions -- Appendix B : Basic complex analysis -- Appendix C : Concepts of probability theory.Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.Combinatorial analysisMathematicsCombinatorial analysis.Mathematics.511.631.12bclFlajolet Philippe62293Sedgewick Robert1946-28576MiAaPQMiAaPQMiAaPQBOOK9910966040603321Analytic combinatorics4354463UNINA