A First Course in Discrete Mathematics

Ian Anderson

ISBN 10: 1852332360 / ISBN 13: 9781852332365

Editore: Springer London Okt 2000, 2000

Riguardo questo articolo

Neuware -Discrete mathematics has now established its place in most undergraduatemathematics courses. This textbook provides a concise, readable andaccessible introduction to a number of topics in this area, such asenumeration, graph theory, Latin squares and designs. It is aimed atsecond-year undergraduate mathematics students, and provides them withmany of the basic techniques, ideas and results. It contains many workedexamples, and each chapter ends with a large number of exercises, withhints or solutions provided for most of them.As well as including standard topics such as binomial coefficientsrecurrence, the inclusion-exclusion principle, trees, Hamiltonian andEulerian graphs, Latin squares and finite projective planes, the text alsoincludes material on the ménage problem, magic squares, Catalan andStirling numbers, and tournament schedules.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 212 pp. Englisch.

Codice articolo 9781852332365

Dati bibliografici

• Titolo: A First Course in Discrete Mathematics
• Editore: Springer London Okt 2000
• Data di pubblicazione: 2000
• Lingua: Inglese
• ISBN 10: 1852332360
• ISBN 13: 9781852332365
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 12 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 12 millimetri di profondità
• Peso: 330 grammi

Descrizione articolo

Riassunto

Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. He concludes with the constructions of schedules and a brief introduction to block designs. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging problems.

Recensione

"Wie der Titel andeutet, handelt es sich bei diesem Buch um eine elementare Einführung in Denkweisen und Methoden der Diskreten Mathematik. Die fachlichen Voraussetzungen an den Leser sind minimal. Darauf aufbauend wird ein doch recht buntes Bild entwickelt, bestehend vor allem aus den wichtigsten Konzepten aus Kombinatorik und Graphentheorie sowie einigen spezielleren Themen wie Designs und Codes.
... Der Vorteil besteht darin, dass auch dem mathematischen Laien auf knapp 200 Seiten ein durchaus einprägsames Bild von einem Zweig der Mathematik vermittelt wird, der in unserer Zeit u.a. durch die Allgegenwart der sogenannten Informationstechnologie extrem an Bedeutung gewonnen hat."
Internationale Mathematische Nachrichten, Nr. 187, August 2001