|
|
|
|
| LEADER |
02096nmm a2200301 u 4500 |
| 001 |
EB001383185 |
| 003 |
EBX01000000000000000906150 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
170324 ||| eng |
| 020 |
|
|
|a 9781107325913
|
| 050 |
|
4 |
|a QA164.8
|
| 100 |
1 |
|
|a Bergeron, F.
|
| 130 |
0 |
|
|a Théorie des espèces et combinatoire des structures arborescentes
|
| 245 |
0 |
0 |
|a Combinatorial species and tree-like structures
|c F. Bergeron, G. Labelle, P. Leroux ; translated from the French by Margaret Readdy
|
| 246 |
3 |
1 |
|a Combinatorial Species & Tree-like Structures
|
| 260 |
|
|
|a Cambridge
|b Cambridge University Press
|c 1998
|
| 300 |
|
|
|a xx, 457 pages
|b digital
|
| 653 |
|
|
|a Combinatorial enumeration problems
|
| 700 |
1 |
|
|a Labelle, Gilbert
|e [author]
|
| 700 |
1 |
|
|a Leroux, P.
|e [author]
|
| 700 |
1 |
|
|a Readdy, Margaret
|e [translator]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b CBO
|a Cambridge Books Online
|
| 490 |
0 |
|
|a Encyclopedia of mathematics and its applications
|
| 856 |
4 |
0 |
|u https://doi.org/10.1017/CBO9781107325913
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.5
|
| 520 |
|
|
|a The combinatorial theory of species, introduced by Joyal in 1980, provides a unified understanding of the use of generating functions for both labelled and unlabelled structures and as a tool for the specification and analysis of these structures. Of particular importance is their capacity to transform recursive definitions of tree-like structures into functional or differential equations, and vice versa. The goal of this book is to present the basic elements of the theory and to give a unified account of its developments and applications. It offers a modern introduction to the use of various generating functions, with applications to graphical enumeration, Polya theory and analysis of data structures in computer science, and to other areas such as special functions, functional equations, asymptotic analysis and differential equations. This book will be a valuable reference to graduate students and researchers in combinatorics, analysis, and theoretical computer science
|