Counting : the art of enumerative combinatorics

George E. Martin

250 pages, parution le 15/07/2001

Ajouter à une liste

Indisponible

Résumé

Counting is hard. "Counting" is short for "Enumerative Combinatorics," which certainly doesn't sound easy. This book provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to... . At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? There are no prerequisites for this course beyond mathematical maturity. The book can be used for a semester course at the sophomore level as introduction to discrete mathematics for mathematics, computer science, and statistics students. The first five chapters can also serve as a basis for a graduate course for in-serivce teachers.

Contents

Elementary Enumeration
The Principle of Inclusion and Exclusion
Generating Functions
Groups
Actions
Recurrence Relations
Mathematical Induction
Graphs
The Back of the Book

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	George E. Martin
Parution	15/07/2001
Nb. de pages	250
Format	16 x 24
Couverture	Relié
Poids	540g
Intérieur	Noir et Blanc
EAN13	9780387952253
ISBN13	978-0-387-95225-3