Constructive Combinatorics / by Dennis Stanton, Dennis White
(Undergraduate Texts in Mathematics)
| データ種別 | 電子ブック |
|---|---|
| 出版情報 | New York, NY : Springer New York , 1986 |
| 本文言語 | 英語 |
| 大きさ | X, 186 p. 3 illus : online resource |
書誌詳細を非表示
| 内容注記 | 1 Listing Basic Combinatorial Objects 1.1 Permutations 1.2 Subsets 1.3 Integer Partitions 1.4 Product Spaces 1.5 Set Partitions Notes Exercises 2 Partially Ordered Sets 2.1 Six Posets 2.2 Matching the Boolean Algebra 2.3 The Littlewood-Offord Problem 2.4 Extremal Set Theory Notes Exercises 3 Bijections 3.1 The Catalan Family 3.2 The Prüfer Correspondence 3.3 Partitions 3.4 Permutations 3.5 Tableaux 3.6 The Schensted Correspondence 3.7 Properties of the Schensted Correspondence Notes Exercises 4 Involutions 4.1 The Euler Pentagonal Number Theorem 4.2 Vandermonde’s Determinant 4.3 The Cayley-Hamilton Theorem 4.4 The Matrix-Tree Theorem 4.5 Lattice Paths 4.6 The Involution Principle Notes Exercises A.1 Permutations A.2 Subsets A.3 Set Partitions A.4 Integer Partitions A.5 Product Spaces A.6 Match to First Available A.7 The Schensted Correspondence A.8 The Prüfer Correspondence A.9 The Involution Principle |
|---|---|
| 一般注記 | The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course |
| 著者標目 | *Stanton, Dennis author White, Dennis author SpringerLink (Online service) |
| 件 名 | LCSH:Mathematics LCSH:Combinatorics FREE:Mathematics FREE:Combinatorics |
| 分 類 | DC23:511.6 |
| 巻冊次 | ISBN:9781461249689 
|
| ISBN | 9781461249689 |
| URL | http://dx.doi.org/10.1007/978-1-4612-4968-9 |
目次／あらすじ