Encyclopedia of Mathematics and its ApplicationsSeries Number 55- Combinatorial Methods in Discrete Mathematics

An account of some complex problems of discrete mathematics. A distinctive aspect of the book is the large number of asymptotic formulae derived.



Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.

Beschikbaarheid: Op voorraad

Bij ons betaalt u ongeacht de hoeveelheid boeken € 3,95 aan verzendkosten in Nederland.

 

Titel	Encyclopedia of Mathematics and its ApplicationsSeries Number 55- Combinatorial Methods in Discrete Mathematics
Artikelnummer	7370caae-e105-44e9-a9a7-4fb6d98cbc4e
Uitgever	Cambridge University Press
Auteur	Vladimir N. Sachkov
Jaartal	1996
Band	Nee
Druk	N/B
Bladzijden	324
Staat	Als nieuw
Toelichting op staat	Nieuwstaat!
ISBN-13	9780521455138