Discrete Mathematics

The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, logical framework, natural numbers, and the integers, in addition to updated chapters from the previous edition. Carefully structured, coherent and comprehensive, each chapter contains tailored exercises and solutions to selected questions, and miscellaneous exercises are presented throughout. This is an invaluable text for students seeking a clear introductinos to discrete mathematics, graph theory, combinatorics, number theory and abstract algebra.

Discrete Mathematics, 2nd Edition

Computers & Technology

Biggs, Norman L.

Computer Science

Oxford University Press

The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, logical framework, natural numbers, and the integers, in addition to updated chapters from the previous edition. Carefully structured, coherent and comprehensive, each chapter contains tailored exercises and solutions to selected questions, and miscellaneous exercises are presented throughout. This is an invaluable text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory and abstract algebra.

Discrete mathematics

Reference

Words, Language & Grammar

This carefully structured text provides a comprehensive, straightforward treatment of discrete mathematics. The author's traditional, deductive approach avoids unnecessary abstraction and covers a wide range of topics, from graph theory and combinatorics to number theory, coding theory and algebraic methods. Abundant examples and exercises help students gain a solid understanding of the subject. The revised edition incorporates changes suggested by instructors already using the text. The new material includes descriptions of algorithms that closely resemble a real programming language for easier implementation by students of both mathematics and computer science.

Science & Math

Mathematics

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.

An introduction to computing in general, and the Pascal language in particular. Biggs (math, London School of Economics) uses a simple model of computing to describe the meaning of a programming language; this framework is then used to develop Pascal from simple constructions through to recursion and pointers. No bibliography. Paper edition (unseen), $18.95. Annotation copyright Book News, Inc. Portland, Or.

Introduction to Computing with Pascal (Oxford Science Publications)

This book is an introduction to computing in general, and the Pascal language in particular. It is suitable for anyone who has studied mathematics up to the age of 16 or thereabouts. A simple model of computing is used to describe the meaning of a programming language, and this framework is used to develop Pascal from the simplest constructions through to recursion and pointers. Programming methodology is treated from a structured, but informal, viewpoint, and the modular approach is stressed throughout. In parallel with the development of Pascal, the book introduces topics of general interest in computing, such as: algorithms and their efficiency, searching and sorting, termination and verification of programs, and abstract data types. Each section contains exercises for the student, and at the end of each chapter there are suggestions for practical work. The intention is to lead the student naturally to more advanced studies of computing, without having to unlearn anything contained in this book.

Programming

First published in 1976, this book has been widely acclaimed as a major and enlivening contribution to the history of mathematics. The updated and corrected paperback contains extracts from the original writings of mathematicians who contributed to the foundations of graph theory. The author's commentary links each piece historically and frames the whole with explanations of the relevant mathematical terminology and notation.

Graph Theory 1736-1936

Wilson, Robin J.

Lloyd, E. Keith

Clarendon Press

This book is based on a set of lectures given to a mixed audience of physicists and mathematicians. The desire to be intelligible to both groups is the underlying preoccupation of the author. Physicists nowadays are particularly interested in phase transitions. The typical situation is that a system of interacting particles exhibits an abrupt change of behaviour at a certain temperature, although the local forces between the particles are thought to be smooth functions of temperature. This account discusses the theory behind a simple model of such phenomena. An important tool is the mathematical discipline known as the Theory of Graphs. There are five chapters, each subdivided into sections. The first chapter is intended as a broad introduction to the subject, and it is written in a more informal manner than the rest. Notes and references for each chapter are given at the end of the chapter.

Interaction Models (London Mathematical Society Lecture Note Series, Series Number 30)

Cambridge University Press

The subject of this book is the action of permutation groups on sets associated with combinatorial structures. Each chapter deals with a particular structure: groups, geometries, designs, graphs and maps respectively. A unifying theme for the first four chapters is the construction of finite simple groups. In the fifth chapter, a theory of maps on orientable surfaces is developed within a combinatorial framework. This simplifies and extends the existing literature in the field. The book is designed both as a course text and as a reference book for advanced undergraduate and graduate students. A feature is the set of carefully constructed projects, intended to give the reader a deeper understanding of the subject.

Permutation Groups and Combinatorial Structures (London Mathematical Society Lecture Note Series, Series Number 33)

White, A.T.

This book is an integrated introduction to the mathematics of coding, that is, replacing information expressed in symbols, such as a natural language or a sequence of bits, by another message using (possibly) different symbols. There are three main reasons for doing this: economy, reliability, and security, and each is covered in detail. Only a modest mathematical background is assumed, the mathematical theory being introduced at a level that enables the basic problems to be stated carefully, but without unnecessary abstraction. Other features include: clear and careful exposition of fundamental concepts, including optimal coding, data compression, and public-key cryptography; concise but complete proofs of results; coverage of recent advances of practical interest, for example in encryption standards, authentication schemes, and elliptic curve cryptography; numerous examples and exercises, and a full solutions manual available to lecturers from www.springer.com.

Codes: An Introduction to Information Communication and Cryptography (Springer Undergraduate Mathematics Series)

Springer

See the best price to sell, buy, or rent books by Biggs, Norman L.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Biggs, Norman L.

See the best price to sell, buy, or rent books by Biggs, Norman L.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Discrete Mathematics, 2nd Edition

Discrete mathematics

Discrete Mathematics

Discrete Mathematics

Introduction to Computing with Pascal (Oxford Science Publications)

Introduction to Computing with Pascal (Oxford Science Publications)

Graph Theory 1736-1936

Interaction Models (London Mathematical Society Lecture Note Series, Series Number 30)

Permutation Groups and Combinatorial Structures (London Mathematical Society Lecture Note Series, Series Number 33)

Codes: An Introduction to Information Communication and Cryptography (Springer Undergraduate Mathematics Series)