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.
"synopsis" may belong to another edition of this title.
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 this title" may belong to another edition of this title.
Seller: Atticus Books, Toronto, ON, Canada
Hardcover. Condition: Very Good. Dust Jacket Condition: Very Good. 1st Edition. A very heavy volume that will require additional postage for destinations outside of the USA. Seller Inventory # H-MFLIBCUL2
Seller: Atticus Books, Toronto, ON, Canada
Hardcover. Condition: Near Fine. Dust Jacket Condition: Near Fine. 1st Edition. Seller Inventory # H-BR168
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0521455138I4N00
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEOCT25-98602
Seller: ALLBOOKS1, Direk, SA, Australia
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address. Seller Inventory # SHAK98602
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2416190003490
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521455138
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780521455138_new
Quantity: Over 20 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. 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. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521455138
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 306 pages. 9.75x6.50x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __0521455138
Quantity: 1 available