S. K. Lando: Independent University of Moscow, Moscow, Russia
This book introduces readers to the language of generating functions, which nowadays, is the main language of enumerative combinatorics. The book starts with definitions, simple properties, and numerous examples of generating functions. It then discusses topics such as formal grammars, generating functions in several variables, partitions and decompositions, and the exclusion-inclusion principle. In the final chapter, the author describes applications to enumeration of trees, plane graphs, and graphs embedded in two-dimensional surfaces.
Throughout the book, the author motivates readers by giving interesting examples rather than general theories. It contains numerous exercises to help students master the material. The only prerequisite is a standard calculus course. The book is an excellent text for a one-semester undergraduate course in combinatorics.
评分
评分
评分
评分
虽然例子不少,但就是喜欢不起来。
评分虽然例子不少,但就是喜欢不起来。
评分虽然例子不少,但就是喜欢不起来。
评分虽然例子不少,但就是喜欢不起来。
评分虽然例子不少,但就是喜欢不起来。
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有