新書推薦：
《
清华大学藏战国竹简校释（柒）：《楚居》诸篇
》
售價：HK$
132.0
《
任伯年册页精选
》
售價：HK$
330.0
《
国之大道G219自驾攻略图——314国道喀什至红其拉甫口岸、独库公路
》
售價：HK$
52.8
《
中国近代史（名家导读版）
》
售價：HK$
90.2
《
《四库全书总目》子部辨证与学术批评研究（全三册）
》
售價：HK$
404.8
《
古代城邦（修订版）（经典与解释·古今丛编）
》
售價：HK$
109.8
《
诱捕：青春穿越小说 穿书系统×双向救赎
》
售價：HK$
52.8
《
战后日本对外文化战略研究（1945—1972）
》
售價：HK$
107.8
|
| 內容簡介： |
Counting problems， or more precisely enumerative combinatorics， are a source of some of the most intriguing problems in mathematics. Often these problems can be solved using ingenious and Creative observations， what we call combinatorial reasoning. It is this kind of thinking that we stress throughout the descriptions， examples， and problems in this text.
Combinatorics has many important applications to areas as diverse as computer science， probability and statistics， and discrete optimization. But equally important， the subject offers many results of beautiful mathematics that are enjoyable to discover and problems that are simply fun to think about and solve in innovative ways.
Each of us has over 40 years of experience teaching combinatorics， as well as other mathematics courses， at both the undergraduate and graduate levels. We think that we have learned some effective ways to present this subject. Early versions of the notes for the book were used in both undergraduate and graduate courses， and our students found the approach both easy to understand and quite thorough.
|
| 目錄：
|
PREFACE
PART I THE BASICS OF ENUMERATIVE COMBINATORICS
1 Initial EnCOUNTers with Combinatorial Reasoning
1．1 Introduction
1．2 The Pigeonhole Principle
1．3 Tiling Chessboards with Dominoes
1．4 Figurate Numbers
1．5 Counting Tilings of Rectangles
1．6 Addition and Multiplication Principles
1．7 Summary and Additional Problems
References
2 Selections， Arrangements， and Distributions
2．1 Introduction
2．2 Permutations and Combinations
2．3 Combinatorial Models
2．4 Permutations and Combinations with Repetitions
2．5 Distributions to Distinct Recipients
2．6 Circular Permutations and Derangements
2．7 Summary and Additional Problems
Reference
3 Binomial Series and Generating Functions
3．1 Introduction
3．2 The Binomial and Multinomial Theorems
3．3 Newtons Binomial Series
3．4 Ordinary Generating Functions
3．5 Exponential Generating Functions
3．6 Summary and Additional Problems
References
4 Alternating Sums， Inclusion-Exclusion Principle， Rook Polynomials， and Fibonacci Nim
4．1 Introduction
4．2 Evaluating Alternating Sums with the DIE Method
4．3 The Principle of lnclusion-Exclusion （PIE）
4．4 Rook Polynomials
4．5 （Optional）Zeckendorf Representations and Fibonacci Nim
4．6 Summary and Additional Problems
References
……
PART IITWO ADDITIONAL TOPICS IN ENUMERATION
PART IIINOTATIONS INDEX， APPENDICES， AND SOLUTIONS TO SELECTED ODD PROBLEMS
Appendix
INDEX
编辑手记
|
|
購物車/收銀台(0) | 在線留言板
| 付款方式
| 運費計算
| 聯絡我們
| 幫助中心 |
加入書簽
HOME
新書上架
暢銷書架
