Combinatorial Methods in Discrete Mathematics - Brossura
Libro 44 di 188: Encyclopedia of Mathematics and its Applications
Sinossi
A 1996 account of some complex problems of discrete mathematics in a simple and unified form.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
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
Descrizione del libro
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Combinatorial Methods in Discrete Mathematics
Foto dell'editore
Combinatorial Methods in Discrete Mathematics (Paperback)
Editore:
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521172769
Compra nuovo
EUR 82,71
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Combinatorial Methods in Discrete Mathematics
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. reissue edition. 306 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand. Codice articolo __0521172764
Compra nuovo
EUR 72,71
Spedizione EUR 11,53
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: 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. . . . . Codice articolo V9780521172769
Compra nuovo
EUR 83,79
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Combinatorial Methods in Discrete Mathematics
Editore:
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9780521172769
Compra nuovo
EUR 77,61
Spedizione EUR 17,93
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Combinatorial Methods in Discrete Mathematics: 55 (Encyclopedia of Mathematics and its Applications, Series Number 55)
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo V9780521172769
Compra nuovo
EUR 102,27
Spedizione EUR 8,97
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Combinatorial Methods in Discrete Mathematics (Paperback)
Editore:
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521172769
Compra nuovo
EUR 80,16
Spedizione EUR 42,67
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Combinatorial Methods in Discrete Mathematics
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 446928649
Compra nuovo
EUR 77,46
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Combinatorial Methods in Discrete Mathematics (Paperback)
Editore:
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
Nuovo
Paperback
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9780521172769
Compra nuovo
EUR 116,45
Spedizione EUR 31,61
Spedito da Australia a U.S.A.
Spedito da Australia a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Combinatorial Methods in Discrete Mathematics
Editore:
Cambridge University Press, 2010
ISBN 10: 0521172764
ISBN 13: 9780521172769
Antico o usato
Brossura
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 322 | Sprache: Englisch | Produktart: Bücher | A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Codice articolo 8817819/202
Compra usato
EUR 44,61
Spedizione EUR 105,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Combinatorial Methods in Discrete Mathematics
Editore:
Cambridge University Press, 2011
ISBN 10: 0521172764
ISBN 13: 9780521172769
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9780521172769
Compra nuovo
EUR 97,27
Spedizione EUR 62,46
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili