Discrete Mathematics

Norman L. Biggs

426 pages, parution le 07/01/2003

Ajouter à une liste

Indisponible

Résumé

This text is a carefully structured, coherent, and comprehensive course of discrete mathematics. The approach is traditional, deductive, and straightforward, with no unnecessary abstraction. It is self-contained including all the fundamental ideas in the field. It can be approached by anyone with basic competence in arithmetic and experience of simple algebraic manipulations. Students of computer science whose curriculum may not allow the study of many ancillary mathematics courses will find it particularly useful.
Mathematics students seeking a first approach to courses such as graph theory, combinatorics, number theory, coding theory, combinatorial optimization, and abstract algebra will also enjoy a clear introduction to these more specialized fields. The main changes to this new edition are to present descriptions of numerous algorithms on a form close to that of a real programming language. The aim is to enable students to develop practical programs from the design of algorithms. Students of mathematics and computer science seeking an eloquent introduction to discrete mathematics will be pleased by this work.

Contents

The Language of Mathematics
1 Statements and proofs
2 Set notation
3 The logical framework
4 Natural numbers
5 Functions
6 How to count
7 Integers
8 Divisibility and prime numbers
9 Fractions and real numbers
Techniques
10 Principles of counting
11 Subsets and designs
12 Partition, classification and distribution
13 Modular arithmetic
Algorithms and Graphs
14 Algorithms and their efficiency
15 Graphs
16 Trees, sorting and searching
17 Bipartite graphs and matching problems
18 Digraphs, networks and flows
19 Recursive techniques
Algebraic Methods
20 Groups
21 Groups of permutations
22 Rings, fields and polynomials
23 Finite fields and some applications
24 Error-correcting codes
25 Generating functions
26 Partitions of a positive integer
27 Symmetry and counting
Answers to Exercises

L'auteur - Norman L. Biggs

Professor of Mathematics, London School of Economics, University of London

Caractéristiques techniques

	PAPIER
Éditeur(s)	Oxford University Press
Auteur(s)	Norman L. Biggs
Parution	07/01/2003
Nb. de pages	426
Format	19 x 24,5
Couverture	Broché
Poids	905g
Intérieur	Noir et Blanc
EAN13	9780198507178
ISBN13	978-0-19-850717-8