Introduction to Combinatorial Analysis

John Riordan

254 pages, parution le 03/03/2003

Ajouter à une liste

Indisponible

Résumé

This introduction to combinatorial analysis defines the subject as "the number of ways there are of doing some well-defined operation."

Chapter 1 surveys that part of the theory of permutations and combinations associated with elementary algebra, which leads to the extended treatment of generating functions in Chapter 2.
Chapter 3 considers the principle of inclusion and exclusion, which is indispensable to the enumeration of permutations with restricted position given in Chapters 7 and 8.
Chapter 4 examines the enumeration of permutations in cyclic representation, while Chapter 5 surveys the theory of distributions and Chapter 6 considers partitions, compositions, and the enumeration of trees and linear graphs.
Each chapter includes a problem section.

Contents

Permutations and Combinations
Generating Functions
The Principle of Inclusion and Exclusion
The Cycles of Permutations
Distributions: Occupancy
Partitions, Compositions, Trees, and Networks
Permutations with Restricted Position I
Permutations with Restricted Position II

Caractéristiques techniques

	PAPIER
Éditeur(s)	Dover
Auteur(s)	John Riordan
Parution	03/03/2003
Nb. de pages	254
Format	13,5 x 21,5
Couverture	Broché
Poids	285g
Intérieur	Noir et Blanc
EAN13	9780486425368
ISBN13	978-0-486-42536-8