Combinatorics: Topics, Techniques, Algorithms
Autor Peter J. Cameronen Limba Engleză Paperback – 5 oct 1994
Preț: 412.85 lei
Preț vechi: 448.75 lei
-8% Nou
Puncte Express: 619
Preț estimativ în valută:
79.02€ • 85.87$ • 66.42£
79.02€ • 85.87$ • 66.42£
Carte disponibilă
Livrare economică 31 martie-14 aprilie
Livrare express 14-20 martie pentru 36.46 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780521457613
ISBN-10: 0521457610
Pagini: 368
Ilustrații: 40 line drawings
Dimensiuni: 191 x 234 x 25 mm
Greutate: 0.61 kg
Ediția:0003
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom
ISBN-10: 0521457610
Pagini: 368
Ilustrații: 40 line drawings
Dimensiuni: 191 x 234 x 25 mm
Greutate: 0.61 kg
Ediția:0003
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom
Cuprins
Preface; 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 theory; 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?; Answers to selected exercises; Bibliography; Index.
Recenzii
"Cameron covers an impressive amount of material in a relatively small space...an outstanding supplement to other texts..." M. Henle, Choice
"...used as a text at the senior or graduate level and is an excellent reference....The range of topics is very good." The UMAP Journal
"...used as a text at the senior or graduate level and is an excellent reference....The range of topics is very good." The UMAP Journal
Descriere
A textbook in combinatorics for second-year undergraduate to beginning graduate students.