Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55) - Softcover
Book 44 of 188: Encyclopedia of Mathematics and its Applications
Synopsis
A 1996 account of some complex problems of discrete mathematics in a simple and unified form.
"synopsis" may belong to another edition of this title.
Review
Review of the hardback: ' ... a very enjoyable and brisk introduction to the exciting fields of enumerative and probabilistic combinatorics'. B. Bollobás, Bulletin of the London Mathematical Society
Review of the hardback: ' ... for the serious student of generating functions and asymptotic techniques it provides an account of the work of Kolchin (who did the translation), the author and others which is not otherwise readily available in English.' I. Anderson, Bulletin of the Edinburgh Mathematical Society
Book Description
A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. 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.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Combinatorial Methods in Discrete Mathematics: 55 (Encyclope...
Stock Image
Combinatorial Methods in Discrete Mathematics (Paperback)
Published by
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521172769
Stock Image
Combinatorial Methods in Discrete Mathematics (Encyclopedia of Mathematics and its Applications, Series Number 55)
Published by
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9780521172769
Stock Image
Combinatorial Methods in Discrete Mathematics (Encyclopedia of Mathematics and its Applications, Series Number 55)
Published by
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Softcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In English. Seller Inventory # ria9780521172769_new
Buy New
£ 61.62
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Combinatorial Methods in Discrete Mathematics
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. reissue edition. 306 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __0521172764
Buy New
£ 64.52
£ 10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)
Published by
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Translator(s): Kolchin, V. F. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 322 pages, black & white illustrations, diagrams, figures. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 17. Weight in Grams: 450. . 2011. Illustrated. paperback. . . . . Seller Inventory # V9780521172769
Buy New
£ 74.75
£ 9.09 shipping
Ships from Ireland to U.S.A.
Ships from Ireland to U.S.A.
Quantity: Over 20 available
Stock Image
Combinatorial Methods in Discrete Mathematics
Published by
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9780521172769
Buy New
£ 68.71
£ 15.55 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)
Published by
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Translator(s): Kolchin, V. F. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 322 pages, black & white illustrations, diagrams, figures. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 17. Weight in Grams: 450. . 2011. Illustrated. paperback. . . . . Books ship from the US and Ireland. Seller Inventory # V9780521172769
Stock Image
Combinatorial Methods in Discrete Mathematics
Published by
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Softcover
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 322. Seller Inventory # 18617355
Stock Image
Combinatorial Methods in Discrete Mathematics (Paperback)
Published by
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Paperback
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521172769
Buy New
£ 67.49
£ 37 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Combinatorial Methods in Discrete Mathematics
Published by
Cambridge University Press, 2010
ISBN 10: 0521172764
ISBN 13: 9780521172769
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. This is an important book, describing many ideas not previously available in E. Seller Inventory # 446928649
Buy New
£ 70.04
£ 42.43 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available