| Titre : | Combinatoire stopies techniques algorithms |
| Auteurs : | P. J. Cameron |
| Type de document : | texte imprimé |
| Editeur : | Cambridge : Cambridge University Press, 1994 |
| ISBN/ISSN/EAN : | 978-0-521-45761-3 |
| Format : | 1 vol. (355 p.) / ill., couv. ill. / 25 cm |
| Langues originales: | |
| Index. décimale : | 511 (Principes généraux des mathématiques) |
| Catégories : | |
| Mots-clés: | Analyse combinatoire Algorithme |
| Résumé : |
Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a constructive or algorithmic proof is more valuable than an existence proof. The book is divided into two parts, the second at a higher level and with a wider range than the first. Historical notes are included which give a wider perspective on the subject. More advanced topics are given as projects and there are a number of exercises, some with solutions given. |
| Note de contenu : |
Sommaire 1. What is Combinatorics? 2. On numbers and counting 3. Subsets, partitions, permutations 4. Recurrence relations and generating functions 5. The Principle of Inclusion and Exclusion 6. Latin squares and SDRs 7. Extremal set theory 8. Steiner triple systems 9. Finite geometry 10. Ramsey's Theorem 11. Graphs 12. Posets, lattices and matroids 13. More on partitions and permutations 14. Automorphism groups and permutation groups 15. Enumeration under group action 16. Designs 17. Error-correcting codes 18. Graph colourings 19. The infinite 20. Where to from here? |
| Côte titre : |
S8/51780-51781 |
Exemplaires (2)
| Cote | Support | Localisation | Disponibilité |
|---|---|---|---|
| S8/51780 | Livre | Bibliothèque centrale | Disponible |
| S8/51781 | Livre | Bibliothèque centrale | Disponible |
Accueil
