|
|
|
|
| LEADER |
03288nmm a2200469 u 4500 |
| 001 |
EB002120086 |
| 003 |
EBX01000000000000001258143 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
221028 ||| eng |
| 020 |
|
|
|a 0080955819
|
| 020 |
|
|
|a 0120897504
|
| 020 |
|
|
|a 9780080955810
|
| 020 |
|
|
|a 1282290002
|
| 020 |
|
|
|a 9780120897506
|
| 050 |
|
4 |
|a QA164
|
| 100 |
1 |
|
|a Berge, Claude
|
| 245 |
0 |
0 |
|a Principles of combinatorics
|c C. Berge
|
| 260 |
|
|
|a New York
|b Academic Press
|c 1971, 1971
|
| 300 |
|
|
|a viii, 176 pages
|b illustrations
|
| 505 |
0 |
|
|a Includes bibliographical references and index
|
| 505 |
0 |
|
|a Front Cover; Principles of Combinatorics; Copyright Page; Contents; Foreword; What Is Combinatorics?; First Aspect: Study of a Known Configuration; Second Aspect : Investigation of an Unknown Configuration; Third Aspect : Counting Configurations; Fourth Aspect : Approximate Counting of Configurations; Fifth Aspect : Enumeration of Configurations; Sixth Aspect: Optimization; References; Chapter 1. The Elemientary Counting Functions; 1. Mappings of Finite Sets; 2. The Cardinality of the Cartesian Product A x X; 3. Number of Subsets of a Finite Set A; 4. Numbers mn or Mappings of X into A
|
| 505 |
0 |
|
|a 5. Numbers [M]n, or Injections of X into A6. Numbers [M]n; 7. Numbers [m]n/n!, or Increasing Mappings of X Into A; 8. Binomial Numbers; 9. Multinomial Numbers(n n1,n2, ... np); 10. Stirling Numbers Snm, or Partitions of n Objects into m Classes; 11. Bell Exponential Number Bn, or the Number of Partitions of n Objects; References; Chapter 2. Partition Problems; 1. Pnm, or the Number of Partitions of Integer n into m Parts; 2. Pn, h, or the Number of Partitions of the Integer n Having h as the Smallest Part; 3. Counting the Standard Tableaus Associated with a Partition of n
|
| 505 |
0 |
|
|a 4. Standard Tableaus and Young's LatticeReferences; Chapter 3. Inversion Formulas and Their Applications; 1. Differential Operator Associated with a Family of Polynomials; 2. The Möbius Function; 3. Sieve Formulas; 4. Distributions; 5. Counting Trees; References; Chapter 4. Permutation Groups; 1. Introduction; 2. Cycles of a Permutation; 3. Orbits of a Permutation Group; 4. Parity of a Permutation; 5. Decomposition Problems; References; Chapter 5. Pólya's Theorem; 1. Counting Schemata Relative to a Group of Permutations of Objects; 2. Counting Schemata Relative to an Arbitrary Group
|
| 505 |
0 |
|
|a 3. A Theorem of de Bruijn4. Computing the Cycle Index; References; Index
|
| 653 |
|
|
|a Combinatorial analysis / fast / (OCoLC)fst00868961
|
| 653 |
|
|
|a Combinatorial analysis / http://id.loc.gov/authorities/subjects/sh85028802
|
| 653 |
|
|
|a Analyse combinatoire
|
| 653 |
|
|
|a Combinatorial analysis
|
| 653 |
|
|
|a MATHEMATICS / Combinatorics / bisacsh
|
| 740 |
0 |
2 |
|a Principes de combinatoire
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
| 490 |
0 |
|
|a Mathematics in science and engineering
|
| 015 |
|
|
|a GB7112975
|
| 776 |
|
|
|z 9780080955810
|
| 776 |
|
|
|z 9780120897506
|
| 776 |
|
|
|z 0080955819
|
| 776 |
|
|
|z 0120897504
|
| 776 |
|
|
|z 9780120897506
|
| 856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/00765392/72
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511/.6
|