A course in combinatorics:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2006
|
| Ausgabe: | 2. ed., 5. print. with corr. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIV, 602 S. graph. Darst. |
| ISBN: | 9780521006019 0521006015 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV022967892 | ||
| 003 | DE-604 | ||
| 005 | 20160201 | ||
| 007 | t | ||
| 008 | 071115s2006 d||| |||| 00||| eng d | ||
| 020 | |a 9780521006019 |9 978-0-521-00601-9 | ||
| 020 | |a 0521006015 |9 0-521-00601-5 | ||
| 035 | |a (OCoLC)263453369 | ||
| 035 | |a (DE-599)BVBBV022967892 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 |a DE-83 |a DE-188 |a DE-898 |a DE-29T | ||
| 050 | 0 | |a QA | |
| 082 | 0 | |a 511.6 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 100 | 1 | |a Lint, Jacobus Hendricus van |d 1932-2004 |e Verfasser |0 (DE-588)119136236 |4 aut | |
| 245 | 1 | 0 | |a A course in combinatorics |c J. H. van Lint and R. M. Wilson |
| 250 | |a 2. ed., 5. print. with corr. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2006 | |
| 300 | |a XIV, 602 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Wilson, R. M. |d 1945- |e Verfasser |0 (DE-588)173142222 |4 aut | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016172181&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016172181 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804137218148663296 |
|---|---|
| adam_text | A COURSE IN COMBINATORICS SECOND EDITION J. H. VAN LINT TECHNICAL
UNIVERSITY OF EINDHOVEN AND R. M. WILSON CALIFORNIA INSTITUTE OF
TECHNOLOGY CAMBRIDGE UNIVERSITY PRESS 2008 AGI-INFORMATION
MANAGEMENT CONSULTANTS MAY BE USED FOR PERSONAL PURPORSES ONLY OR BY
LIBRARIES ASSOCIATED TO DANDELON.COM NETWORK. CONTENTS PREFACE TO THE
FIRST EDITION PREFACE TO THE SECOND EDITION 1. GRAPHS TERMINOLOGY OF
GRAPHS AND DIGRAPHS, EULERIAN CIR- CUITS, HAMILTONIAN CIRCUITS 2. TREES
CAYLEY S THEOREM, SPANNING TREES AND THE GREEDY ALGORITHM, SEARCH TREES,
STRONG CONNECTIVITY 3. COLORINGS OF GRAPHS AND RAMSEY S THEOREM BROOKS
THEOREM, RAMSEY S THEOREM AND RAMSEY *JBUMBERS, THE LOVASZ SIEVE, THE
ERDOS-SZEKERES OREM TURAN S THEOREM AND EXTREMAL GRAPHS T S THEOREM AND
EXTREMAL GRAPH THEORY ^SYSTEMS OF DISTINCT REPRESENTATIVES TITE GRAPHS,
P. HALL S CONDITION, SDRS, KONIG S BIRKHOFF S THEOREM RTH S THEOREM AND
EXTREMAL SET THEORY I ORDERED SETS, DILWORTH S THEOREM, SPERNER S
NMETRIC CHAINS, THE ERDOS-KO-RADO IN NETWORKS RSON THEOREM, THE
INTEGRALITY THEOREM, (TEN OF BIRKHOFF S THEOREM, CIRCULATIONS SEQUENCES
J F DE BRUIJN SEQUENCES XI XIII 1 12 24 37 43 53 61 71 VI A COURSE IN
COMBINATORICS 9. TWO (0,1,*) PROBLEMS: ADDRESSING FOR GRAPHS AND A
HASH-CODING SCHEME QUADRATIC FORMS, WINKLER S THEOREM, ASSOCIATIVE BLOCK
DESIGNS 10. THE PRINCIPLE OF INCLUSION AND EXCLUSION; INVERSION FORMULAE
INCLUSION-EXCLUSION, DERANGEMENTS, EULER INDICA- TOR, MOBIUS FUNCTION,
MOBIUS INVERSION, BURNSIDE S LEMMA, PROBLEME DES MENAGES 11. PERMANENTS
BOUNDS ON PERMANENTS, SCHRIJVER S PROOF OF THE MINE CONJECTURE, FEKETE S
LEMMA, PERMANENTS OF DOUBLY STOCHASTIC MATRICES 12. THE VAN DER WAERDEN
CONJECTURE THE EARLY RESULTS OF MARCUS AND NEWMAN, LONDON S THEOREM,
EGORITSJEV S PROOF 13. ELEMENTARY COUNTING; STIRLING NUMBERS STIRLING
NUMBERS OF THE FIRST AND SECOND KIND, BELL NUMBERS, GENERATING FUNCTIONS
14. RECURSIONS AND GENERATING FUNCTIONS ELEMENTARY RECURRENCES, CATALAN
NUMBERS, COUNTING OF TREES, JOYAL THEORY, LAGRANGE INVERSION 15.
PARTITIONS THE FUNCTION PK {N), THE PARTITION FUNCTION, FERRERS
DIAGRAMS, EULER S IDENTITY, ASYMPTOTICS, THE JACOBI TRIPLE PRODUCT
IDENTITY, YOUNG TABLEAUX AND THE HOOK FORMULA 16. (0,1)-MATRICES
MATRICES WITH GIVEN LINE SUMS, COUNTING (0, 1)- MATRICES 17. LATIN
SQUARES ORTHOGONAL ARRAYS, CONJUGATES AND ISOMORPHISM, PARTIAL AND
INCOMPLETE LATIN SQUARES, COUNTING LATIN SQUARES, THE EVANS CONJECTURE,
THE DINITZ CONJECTURE 18. HADAMARD MATRICES, REED*MULLER CODES HADAMARD
MATRICES AND CONFERENCE MATRICES, RE- CURSIVE CONSTRUCTIONS, PALEY
MATRICES, WILLIAMSON S METHOD, EXCESS OF A HADAMARD MATRIX, FIRST ORDER
REED-MULLER CODES 77 89 98 110 119 129 152 169 182 199 CONTENTS VN 19.
DESIGNS 215 THE ERDOS-DE BRUIJN THEOREM, STEINER SYSTEMS, BALANCED
INCOMPLETE BLOCK DESIGNS, HADAMARD DESIGNS, COUNTING, (HIGHER) INCIDENCE
MATRICES, THE WILSON- PETRENJUK THEOREM, SYMMETRIC DESIGNS, PROJECTIVE
PLANES, DERIVED AND RESIDUAL DESIGNS, THE BRUCK- RYSER-CHOWLA THEOREM,
CONSTRUCTIONS OF STEINER TRIPLE SYSTEMS, WRITE-ONCE MEMORIES 20. CODES
AND DESIGNS 244 TERMINOLOGY OF CODING THEORY, THE HAMMING BOUND, THE
SINGLETON BOUND, WEIGHT ENUMERATORS AND MACWILLIAMS THEOREM, THE
ASSMUS-MATTSON THEOREM, SYMMETRY CODES, THE GOLAY CODES, CODES FROM
PROJEC- TIVE PLANES 21. STRONGLY REGULAR GRAPHS AND PARTIAL GEOMETRIES
261 THE BOSE-MESNER ALGEBRA, EIGENVALUES, THE INTEGRALITY CONDITION,
QUASISYMMETRIC DESIGNS, THE KREIN CONDI- TION, THE ABSOLUTE BOUND,
UNIQUENESS THEOREMS, PARTIAL GEOMETRIES, EXAMPLES, DIRECTED STRONGLY
REGULAR GRAPHS, NEIGHBORHOOD REGULAR GRAPHS 22. ORTHOGONAL LATIN SQUARES
283 PAIRWISE ORTHOGONAL LATIN SQUARES AND NETS, EULER S CONJECTURE, THE
BOSE-P ARKER-SHRIKHANDE THEOREM, ASYMPTOTIC EXISTENCE, ORTHOGONAL ARRAYS
AND TRANSVER- SAL DESIGNS, DIFFERENCE METHODS, ORTHOGONAL SUBSQUARES 23.
PROJECTIVE AND COMBINATORIAL GEOMETRIES 303 PROJECTIVE AND AFFINE
GEOMETRIES, DUALITY, PASCH S AXIOM, DESARGUES THEOREM, COMBINATORIAL
GEOMETRIES, GEOMETRIC LATTICES, GREENE S THEOREM 24. GAUSSIAN NUMBERS
AND G-ANALOGUES 325 CHAINS IN THE LATTICE OF SUBSPACES, Q-ANALOGUE OF
SPERNER S THEOREM, INTERPRETATION OF THE COEFFICIENTS OF THE. GAUSSIAN
POLYNOMIALS, SPREADS $ LATTICES AND MOBIUS INVERSION 333 THE INCIDENCE
ALGEBRA OF A POSET, THE MOBIUS FUNC- CHROMATIC POLYNOMIAL OF A GRAPH,
WEISNER S COMPLEMENTING PERMUTATIONS OF GEOMETRIC CONNECTED LABELED
GRAPHS, MDS CODES COMBINATORIAL DESIGNS AND PROJECTIVE GEOMETRIES 351
F AND SUBPLANES IN PROJECTIVE PLANES, BLOCKING QUADRATIC AND HERMITIAN
FORMS, UNITALS, GENERAL- F QUADRANGLES, MOBIUS PLANES VLLL A COURSE IN
COMBINATORICS 27. DIFFERENCE SETS AND AUTOMORPHISMS 369 BLOCK S LEMMA,
AUTOMORPHISMS OF SYMMETRIC DE- SIGNS, PALEY-TODD AND STANTON-SPROTT
DIFFERENCE SETS, SINGER S THEOREM 28. DIFFERENCE SETS AND THE GROUP RING
383 THE MULTIPLIER THEOREM AND EXTENSIONS, HOMOMOR- PHISMS AND FURTHER
NECESSARY CONDITIONS 29. CODES AND SYMMETRIC DESIGNS 396 THE SEQUENCE OF
CODES OF A SYMMETRIC DESIGN, WILBRINK S THEOREM 30. ASSOCIATION SCHEMES
405 EXAMPLES, THE EIGENMATRICES AND ORTHOGONALITY RE- LATIONS, FORMAL
DUALITY, THE DISTRIBUTION VECTOR OF A SUBSET, DELSARTE S INEQUALITIES,
POLYNOMIAL SCHEMES, PERFECT CODES AND TIGHT DESIGNS 31. (MORE) ALGEBRAIC
TECHNIQUES IN GRAPH THEORY 432 TOURNAMENTS AND THE GRAHAM-POLLAK
THEOREM, THE SPECTRUM OF A GRAPH, HOFFMAN S THEOREM, SHANNON CAPACITY,
APPLICATIONS OF INTERLACING AND PERRON- FROBENIUS 32. GRAPH CONNECTIVITY
451 VERTEX CONNECTIVITY, MENGER S THEOREM, TUTTE CONNEC- TIVITY 33.
PLANARITY AND COLORING 459 THE CHROMATIC POLYNOMIAL, KURATOWSKI S
THEOREM, EULER S FORMULA, THE FIVE COLOR THEOREM, LIST-COLORINGS 34.
WHITNEY DUALITY WHITNEY DUALITY, CIRCUITS AND CUTSETS, MACLANE S THEOREM
35. EMBEDDINGS OF GRAPHS ON SURFACES EMBEDDINGS ON ARBITRARY SURFACES,
THE RINGEL-YOUNGS THEOREM, THE HEAWOOD CONJECTURE, THE EDMONDS EMBED-
DING TECHNIQUE 36. ELECTRICAL NETWORKS AND SQUARED SQUARES THE
MATRIX-TREE THEOREM, DE BRUIJN SEQUENCES, THE NETWORK OF A SQUARED
RECTANGLE, KIRCHHOFF S THEOREM 37. POLYA THEORY OF COUNTING THE CYCLE
INDEX OF A PERMUTATION GROUP, COUNTING ORBITS, WEIGHTS, NECKLACES, THE
SYMMETRIC GROUP, STIR- LING NUMBERS 472 491 507 522 CONTENTS 38.
BARANYAI S THEOREM ONE-FACTORIZATIONS OF COMPLETE GRAPHS AND COMPLETE
DESIGNS APPENDIX 1. HINTS AND COMMENTS ON PROBLEMS HINTS, SUGGESTIONS,
AND COMMENTS ON THE PROBLEMS IN EACH CHAPTER APPENDIX 2. FORMAL POWER
SERIES FORMAL POWER SERIES RING, FORMAL DERIVATIVES, INVERSE FUNCTIONS,
RESIDUES, THE LAGRANGE-BIIRMANN FORMULA NAME INDEX SUBJECT INDEX IX 536
542 578 584 590
|
| adam_txt |
A COURSE IN COMBINATORICS SECOND EDITION J. H. VAN LINT TECHNICAL
UNIVERSITY OF EINDHOVEN AND R. M. WILSON CALIFORNIA INSTITUTE OF
TECHNOLOGY CAMBRIDGE UNIVERSITY PRESS 2008 AGI-INFORMATION
MANAGEMENT CONSULTANTS MAY BE USED FOR PERSONAL PURPORSES ONLY OR BY
LIBRARIES ASSOCIATED TO DANDELON.COM NETWORK. CONTENTS PREFACE TO THE
FIRST EDITION PREFACE TO THE SECOND EDITION 1. GRAPHS TERMINOLOGY OF
GRAPHS AND DIGRAPHS, EULERIAN CIR- CUITS, HAMILTONIAN CIRCUITS 2. TREES
CAYLEY'S THEOREM, SPANNING TREES AND THE GREEDY ALGORITHM, SEARCH TREES,
STRONG CONNECTIVITY 3. COLORINGS OF GRAPHS AND RAMSEY'S THEOREM BROOKS'
THEOREM, RAMSEY'S THEOREM AND RAMSEY *JBUMBERS, THE LOVASZ SIEVE, THE
ERDOS-SZEKERES OREM TURAN'S THEOREM AND EXTREMAL GRAPHS T'S THEOREM AND
EXTREMAL GRAPH THEORY ^SYSTEMS OF DISTINCT REPRESENTATIVES TITE GRAPHS,
P. HALL'S CONDITION, SDRS, KONIG'S BIRKHOFF'S THEOREM RTH'S THEOREM AND
EXTREMAL SET THEORY I ORDERED SETS, DILWORTH'S THEOREM, SPERNER'S
NMETRIC CHAINS, THE ERDOS-KO-RADO IN NETWORKS RSON THEOREM, THE
INTEGRALITY THEOREM, (TEN OF BIRKHOFF'S THEOREM, CIRCULATIONS SEQUENCES
J F DE BRUIJN SEQUENCES XI XIII 1 12 24 37 43 53 61 71 VI A COURSE IN
COMBINATORICS 9. TWO (0,1,*) PROBLEMS: ADDRESSING FOR GRAPHS AND A
HASH-CODING SCHEME QUADRATIC FORMS, WINKLER'S THEOREM, ASSOCIATIVE BLOCK
DESIGNS 10. THE PRINCIPLE OF INCLUSION AND EXCLUSION; INVERSION FORMULAE
INCLUSION-EXCLUSION, DERANGEMENTS, EULER INDICA- TOR, MOBIUS FUNCTION,
MOBIUS INVERSION, BURNSIDE'S LEMMA, PROBLEME DES MENAGES 11. PERMANENTS
BOUNDS ON PERMANENTS, SCHRIJVER'S PROOF OF THE MINE CONJECTURE, FEKETE'S
LEMMA, PERMANENTS OF DOUBLY STOCHASTIC MATRICES 12. THE VAN DER WAERDEN
CONJECTURE THE EARLY RESULTS OF MARCUS AND NEWMAN, LONDON'S THEOREM,
EGORITSJEV'S PROOF 13. ELEMENTARY COUNTING; STIRLING NUMBERS STIRLING
NUMBERS OF THE FIRST AND SECOND KIND, BELL NUMBERS, GENERATING FUNCTIONS
14. RECURSIONS AND GENERATING FUNCTIONS ELEMENTARY RECURRENCES, CATALAN
NUMBERS, COUNTING OF TREES, JOYAL THEORY, LAGRANGE INVERSION 15.
PARTITIONS THE FUNCTION PK {N), THE PARTITION FUNCTION, FERRERS
DIAGRAMS, EULER'S IDENTITY, ASYMPTOTICS, THE JACOBI TRIPLE PRODUCT
IDENTITY, YOUNG TABLEAUX AND THE HOOK FORMULA 16. (0,1)-MATRICES
MATRICES WITH GIVEN LINE SUMS, COUNTING (0, 1)- MATRICES 17. LATIN
SQUARES ORTHOGONAL ARRAYS, CONJUGATES AND ISOMORPHISM, PARTIAL AND
INCOMPLETE LATIN SQUARES, COUNTING LATIN SQUARES, THE EVANS CONJECTURE,
THE DINITZ CONJECTURE 18. HADAMARD MATRICES, REED*MULLER CODES HADAMARD
MATRICES AND CONFERENCE MATRICES, RE- CURSIVE CONSTRUCTIONS, PALEY
MATRICES, WILLIAMSON'S METHOD, EXCESS OF A HADAMARD MATRIX, FIRST ORDER
REED-MULLER CODES 77 89 98 110 119 129 152 169 182 199 CONTENTS VN 19.
DESIGNS 215 THE ERDOS-DE BRUIJN THEOREM, STEINER SYSTEMS, BALANCED
INCOMPLETE BLOCK DESIGNS, HADAMARD DESIGNS, COUNTING, (HIGHER) INCIDENCE
MATRICES, THE WILSON- PETRENJUK THEOREM, SYMMETRIC DESIGNS, PROJECTIVE
PLANES, DERIVED AND RESIDUAL DESIGNS, THE BRUCK- RYSER-CHOWLA THEOREM,
CONSTRUCTIONS OF STEINER TRIPLE SYSTEMS, WRITE-ONCE MEMORIES 20. CODES
AND DESIGNS 244 TERMINOLOGY OF CODING THEORY, THE HAMMING BOUND, THE
SINGLETON BOUND, WEIGHT ENUMERATORS AND MACWILLIAMS' THEOREM, THE
ASSMUS-MATTSON THEOREM, SYMMETRY CODES, THE GOLAY CODES, CODES FROM
PROJEC- TIVE PLANES 21. STRONGLY REGULAR GRAPHS AND PARTIAL GEOMETRIES
261 THE BOSE-MESNER ALGEBRA, EIGENVALUES, THE INTEGRALITY CONDITION,
QUASISYMMETRIC DESIGNS, THE KREIN CONDI- TION, THE ABSOLUTE BOUND,
UNIQUENESS THEOREMS, PARTIAL GEOMETRIES, EXAMPLES, DIRECTED STRONGLY
REGULAR GRAPHS, NEIGHBORHOOD REGULAR GRAPHS 22. ORTHOGONAL LATIN SQUARES
283 PAIRWISE ORTHOGONAL LATIN SQUARES AND NETS, EULER'S CONJECTURE, THE
BOSE-P ARKER-SHRIKHANDE THEOREM, ASYMPTOTIC EXISTENCE, ORTHOGONAL ARRAYS
AND TRANSVER- SAL DESIGNS, DIFFERENCE METHODS, ORTHOGONAL SUBSQUARES 23.
PROJECTIVE AND COMBINATORIAL GEOMETRIES 303 PROJECTIVE AND AFFINE
GEOMETRIES, DUALITY, PASCH'S AXIOM, DESARGUES' THEOREM, COMBINATORIAL
GEOMETRIES, GEOMETRIC LATTICES, GREENE'S THEOREM 24. GAUSSIAN NUMBERS
AND G-ANALOGUES 325 CHAINS IN THE LATTICE OF SUBSPACES, Q-ANALOGUE OF
SPERNER'S THEOREM, INTERPRETATION OF THE COEFFICIENTS OF THE. GAUSSIAN
POLYNOMIALS, SPREADS $ LATTICES AND MOBIUS INVERSION 333 THE INCIDENCE
ALGEBRA OF A POSET, THE MOBIUS FUNC- CHROMATIC POLYNOMIAL OF A GRAPH,
WEISNER'S COMPLEMENTING PERMUTATIONS OF GEOMETRIC CONNECTED LABELED
GRAPHS, MDS CODES COMBINATORIAL DESIGNS AND PROJECTIVE GEOMETRIES 351 \
F AND SUBPLANES IN PROJECTIVE PLANES, BLOCKING QUADRATIC AND HERMITIAN
FORMS, UNITALS, GENERAL- F QUADRANGLES, MOBIUS PLANES VLLL A COURSE IN
COMBINATORICS 27. DIFFERENCE SETS AND AUTOMORPHISMS 369 BLOCK'S LEMMA,
AUTOMORPHISMS OF SYMMETRIC DE- SIGNS, PALEY-TODD AND STANTON-SPROTT
DIFFERENCE SETS, SINGER'S THEOREM 28. DIFFERENCE SETS AND THE GROUP RING
383 THE MULTIPLIER THEOREM AND EXTENSIONS, HOMOMOR- PHISMS AND FURTHER
NECESSARY CONDITIONS 29. CODES AND SYMMETRIC DESIGNS 396 THE SEQUENCE OF
CODES OF A SYMMETRIC DESIGN, WILBRINK'S THEOREM 30. ASSOCIATION SCHEMES
405 EXAMPLES, THE EIGENMATRICES AND ORTHOGONALITY RE- LATIONS, FORMAL
DUALITY, THE DISTRIBUTION VECTOR OF A SUBSET, DELSARTE'S INEQUALITIES,
POLYNOMIAL SCHEMES, PERFECT CODES AND TIGHT DESIGNS 31. (MORE) ALGEBRAIC
TECHNIQUES IN GRAPH THEORY 432 TOURNAMENTS AND THE GRAHAM-POLLAK
THEOREM, THE SPECTRUM OF A GRAPH, HOFFMAN'S THEOREM, SHANNON CAPACITY,
APPLICATIONS OF INTERLACING AND PERRON- FROBENIUS 32. GRAPH CONNECTIVITY
451 VERTEX CONNECTIVITY, MENGER'S THEOREM, TUTTE CONNEC- TIVITY 33.
PLANARITY AND COLORING 459 THE CHROMATIC POLYNOMIAL, KURATOWSKI'S
THEOREM, EULER'S FORMULA, THE FIVE COLOR THEOREM, LIST-COLORINGS 34.
WHITNEY DUALITY WHITNEY DUALITY, CIRCUITS AND CUTSETS, MACLANE'S THEOREM
35. EMBEDDINGS OF GRAPHS ON SURFACES EMBEDDINGS ON ARBITRARY SURFACES,
THE RINGEL-YOUNGS THEOREM, THE HEAWOOD CONJECTURE, THE EDMONDS EMBED-
DING TECHNIQUE 36. ELECTRICAL NETWORKS AND SQUARED SQUARES THE
MATRIX-TREE THEOREM, DE BRUIJN SEQUENCES, THE NETWORK OF A SQUARED
RECTANGLE, KIRCHHOFF'S THEOREM 37. POLYA THEORY OF COUNTING THE CYCLE
INDEX OF A PERMUTATION GROUP, COUNTING ORBITS, WEIGHTS, NECKLACES, THE
SYMMETRIC GROUP, STIR- LING NUMBERS 472 491 507 522 CONTENTS 38.
BARANYAI'S THEOREM ONE-FACTORIZATIONS OF COMPLETE GRAPHS AND COMPLETE
DESIGNS APPENDIX 1. HINTS AND COMMENTS ON PROBLEMS HINTS, SUGGESTIONS,
AND COMMENTS ON THE PROBLEMS IN EACH CHAPTER APPENDIX 2. FORMAL POWER
SERIES FORMAL POWER SERIES RING, FORMAL DERIVATIVES, INVERSE FUNCTIONS,
RESIDUES, THE LAGRANGE-BIIRMANN FORMULA NAME INDEX SUBJECT INDEX IX 536
542 578 584 590 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Lint, Jacobus Hendricus van 1932-2004 Wilson, R. M. 1945- |
| author_GND | (DE-588)119136236 (DE-588)173142222 |
| author_facet | Lint, Jacobus Hendricus van 1932-2004 Wilson, R. M. 1945- |
| author_role | aut aut |
| author_sort | Lint, Jacobus Hendricus van 1932-2004 |
| author_variant | j h v l jhv jhvl r m w rm rmw |
| building | Verbundindex |
| bvnumber | BV022967892 |
| callnumber-first | Q - Science |
| callnumber-label | QA |
| callnumber-raw | QA |
| callnumber-search | QA |
| callnumber-sort | QA |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 170 |
| ctrlnum | (OCoLC)263453369 (DE-599)BVBBV022967892 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| edition | 2. ed., 5. print. with corr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01599nam a2200397 c 4500</leader><controlfield tag="001">BV022967892</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160201 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">071115s2006 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521006019</subfield><subfield code="9">978-0-521-00601-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521006015</subfield><subfield code="9">0-521-00601-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)263453369</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022967892</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lint, Jacobus Hendricus van</subfield><subfield code="d">1932-2004</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)119136236</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A course in combinatorics</subfield><subfield code="c">J. H. van Lint and R. M. Wilson</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed., 5. print. with corr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 602 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilson, R. M.</subfield><subfield code="d">1945-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)173142222</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016172181&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016172181</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV022967892 |
| illustrated | Illustrated |
| index_date | 2024-07-02T19:07:24Z |
| indexdate | 2024-07-09T21:08:48Z |
| institution | BVB |
| isbn | 9780521006019 0521006015 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016172181 |
| oclc_num | 263453369 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-83 DE-188 DE-898 DE-BY-UBR DE-29T |
| owner_facet | DE-19 DE-BY-UBM DE-83 DE-188 DE-898 DE-BY-UBR DE-29T |
| physical | XIV, 602 S. graph. Darst. |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spelling | Lint, Jacobus Hendricus van 1932-2004 Verfasser (DE-588)119136236 aut A course in combinatorics J. H. van Lint and R. M. Wilson 2. ed., 5. print. with corr. Cambridge [u.a.] Cambridge Univ. Press 2006 XIV, 602 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Kombinatorik (DE-588)4031824-2 gnd rswk-swf 1\p (DE-588)4123623-3 Lehrbuch gnd-content Kombinatorik (DE-588)4031824-2 s DE-604 Wilson, R. M. 1945- Verfasser (DE-588)173142222 aut HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016172181&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Lint, Jacobus Hendricus van 1932-2004 Wilson, R. M. 1945- A course in combinatorics Kombinatorik (DE-588)4031824-2 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)4123623-3 |
| title | A course in combinatorics |
| title_auth | A course in combinatorics |
| title_exact_search | A course in combinatorics |
| title_exact_search_txtP | A course in combinatorics |
| title_full | A course in combinatorics J. H. van Lint and R. M. Wilson |
| title_fullStr | A course in combinatorics J. H. van Lint and R. M. Wilson |
| title_full_unstemmed | A course in combinatorics J. H. van Lint and R. M. Wilson |
| title_short | A course in combinatorics |
| title_sort | a course in combinatorics |
| topic | Kombinatorik (DE-588)4031824-2 gnd |
| topic_facet | Kombinatorik Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016172181&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT lintjacobushendricusvan acourseincombinatorics AT wilsonrm acourseincombinatorics |