Combinatorial Methods in Discrete Mathematics (Encyclopedia of Mathematics and its Applications, Series Number 55)
Language: English
Published by Cambridge University Press, 1996
Series: Book 44 of 188 - Encyclopedia of Mathematics and its Applications
- Hardcover
- New

Seller: California Books, Miami, FL, U.S.A.California Books
5-star seller
AbeBooks seller since October 27, 2023
Hardcover
Condition: New
US$ 179.00
Free Shipping
Ships within U.S.A.
Quantity: Over 20 available
Add to basketFree 30-day returns
Seller Inventory # I-9780521455138
- Title
- Combinatorial Methods in Discrete Mathematics (Encyclopedia of Mathematics and its Applications, Series Number 55)
- Author
- Sachkov, Vladimir N.
- Publisher
- Cambridge University Press
- Publication year
- 1996
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0521455138
- ISBN 13
- 9780521455138
- Series
- Book 44 of 188: Encyclopedia of Mathematics and its Applications
Discrete mathematics is an important tool for the investigation of various models of functioning of technical devices, especially in the field of cybernetics. Here the author presents some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. Professor Sachkov's aim is to focus attention on results 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, considered in Chapter 4. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book for graduate students and professionals that describes many ideas not previously available in English; the author has updated the text and references where appropriate.
"Synopsis" may belong to another edition of this title.
From the Back Cover
This is an attempt to present 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 those 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 4. The general combinatorial scheme is then introduced and, in the final 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 opportunity to update the text and references where appropriate.
"About the title" may belong to another edition of this title.
California Books
Miami, FL, U.S.A.
5-star seller
AbeBooks seller since October 27, 2023
Shipping rates within U.S.A.
| Item | 3 to 7 business days | 2 to 5 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 12.00 |
Payment methods
Store description
We have 20 years experience selling books worldwide! Friendly customer support. Your satisfaction guaranteed!
Specialty
All authorized categoriesSeller's business information
Miramar International Services LLC
FL, U.S.A.
Terms of sale
www.californiabooks.com
Shipping terms
www.californiabooks.com