组合数学(英文版.第5版) 本书特色

《组合数学(英文版)(第5版)》是系统阐述组合数学基础,理论、方法和实例的优秀教材。出版30多年来多次改版。被MIT、哥伦比亚大学、UIUC、威斯康星大学等众多国外高校采用,对国内外组合数学教学产生了较大影响。也是相关学科的主要参考文献之一。《组合数学(英文版)(第5版)》侧重于组合数学的概念和思想。包括鸽巢原理、计数技术、排列组合、Polya计数法、二项式系数、容斥原理、生成函数和递推关系以及组合结构(匹配,实验设计、图)等。深入浅出地表达了作者对该领域全面和深刻的理解。除包含第4版中的内容外。本版又进行了更新。增加了有限概率、匹配数等内容。此外,各章均包含大量练习题。并在书末给出了参考答案与提示。

组合数学(英文版.第5版) 内容简介

本书是系统阐述组合数学基础、理论、方法和实例的优秀教材，出版30多年来多次改版，被mit、哥伦比亚大学、uiuc、威斯康星大学等众多国外高校采用，对国内外组合数学教学产生了较大影响，也是相关学科的主要参考文献之一。
本书侧重于组合数学的概念和思想。包括鸽巢原理、计数技术、排列组合、p61ya计数法、二项式系数、容斥原理、生成函数和递推关系以及组合结构（匹配、实验设计、图）等。深入浅出地表达了作者对该领域全面和深刻的理解。除包含第4版中的内容外，本版又进行了更新，增加了有限概率、匹配数等内容。此外，各章均包含大量练习题，并在书末给出了参考答案与提示。

组合数学(英文版.第5版) 目录

preface
1 what 'is combinatorics?
1.1 example: perfect covers of chessboards
1.2 example: magic squares
1.3 example: the four-color problem
1.4 example: the problem of the 36 officers
1.5 ,example: shortest-route problem
1.6 example: mutually overlapping circles
1.7 example: the game of nim
1.8 exercises
2 permutations and combinations
2.1 four basic counting principles
2.2 permutations of sets
2.3 combinations (subsets) of sets
2.4 permutations of multisets
2.5 combinations of multisets
2.6 finite probability
2.7 exercises
3 the pigeonhole principle
3.1 pigeonhole principle: simple form
3.2 pigeonhole principle: strong form
3.3 a theorem of ramsey
3.4 exercises
4 generating permutations and combinations
4.1 generating permutations
4.2 inversions in permutations
4.3 generating combinations
4.4 generating r-subsets
4.5 partial orders and equivalence relations
4.6 exercises
5 the binomial coefficients
5.1 pascal's triangle
5.2 the binomial theorem
5.3 unimodality of binomial coefficients
5.4 the multinomial theorem
5.5 newton's binomial theorem
5.6 more on partially ordered sets
5.7 exercises
6 the inclusion-exclusion principle and applications
6.1 the inclusion-exclusion principle
6.2 combinations with repetition
6.3 derangements
6.4 permutations with forbidden positions
6.5 another forbidden position problem
6.6 m6bius inversion
6.7 exercises
7 recurrence relations and generating functions
7.1 some number sequences
7.2 generating functions
7.3 exponential generating functions
7.4 solving linear homogeneous recurrence relations ..
7.5 nonhomogeneous recurrence relations
7.6 a geometry example
7.7 exercises
8 special counting sequences
8.1 catalan numbers
8.2 difference sequences and stirling numbers
8.3 partition numbers
8.4 a geometric problem
8.5 lattice paths and schr6der numbers
8.6 exercises
9 systems of distinct representatives
10 combinatorial designs
11 introduction to graph theory
12 more ongraph theory
13 digraphs and networks
14 polya counting
answers and hints to exercises
bibliography
index

 1/2    1 2 下一页 尾页

自然科学 数学 代数数论组合理论

在线阅读