Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in – Combinatorics – Probability Theory – Statistics – Theory of Markov Chains – Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.
购买此电子书可免费获赠一本!
语言 英语 ● 格式 PDF ● 网页 192 ● ISBN 9781439864395 ● 出版者 CRC Press ● 发布时间 2005 ● 下载 3 时 ● 货币 EUR ● ID 4092177 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器