Автор: Flajolet Название: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Издательство: Cambridge Academ Рейтинг: Цена: 88710.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications. Exercises, examples, appendices and notes aid understanding: ideal for individual self-study or for advanced undergraduate or graduate courses.
Автор: Stanley Название: Enumerative Combinatorics ISBN: 1107602629 ISBN-13(EAN): 9781107602625 Издательство: Cambridge Academ Рейтинг: Цена: 39920.00 T Наличие на складе: Есть Описание: Richard Stanley`s two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes more than 300 new exercises, many with solutions, updated and expanded chapter bibliographies and substantial new material on permutation statistics.
Автор: Bona Miklos Название: Introduction to Enumerative and Analytic Combinatorics ISBN: 148224909X ISBN-13(EAN): 9781482249095 Издательство: Taylor&Francis Рейтинг: Цена: 88800.00 T Наличие на складе: Нет в наличии. Описание:
Introduction to Enumerative and Analytic Combinatorics fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics. The book first deals with basic counting principles, compositions and partitions, and generating functions. It then focuses on the structure of permutations, graph enumeration, and extremal combinatorics. Lastly, the text discusses supplemental topics, including error-correcting codes, properties of sequences, and magic squares.
Strengthening the analytic flavor of the book, this Second Edition:
Features a new chapter on analytic combinatorics and new sections on advanced applications of generating functions
Demonstrates powerful techniques that do not require the residue theorem or complex integration
Adds new exercises to all chapters, significantly extending coverage of the given topics
Introduction to Enumerative and Analytic Combinatorics, Second Edition makes combinatorics more accessible, increasing interest in this rapidly expanding field.
Outstanding Academic Title of the Year, Choice magazine, American Library Association.
Автор: George E. Martin Название: Counting: The Art of Enumerative Combinatorics ISBN: 1441929150 ISBN-13(EAN): 9781441929150 Издательство: Springer Рейтинг: Цена: 52130.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...For example, How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available? At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to color the faces of a cube if k colors are available with each face having exactly one color? or How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? Since there are no prerequisites, this book can be used for college courses in combinatorics at the sophomore level for either computer science or mathematics students. The first five chapters have served as the basis for a graduate course for in-service teachers. Chapter 8 introduces graph theory.
Автор: Stanley, Richard Название: Enumerative Combinatorics, vol.2 ISBN: 0521789877 ISBN-13(EAN): 9780521789875 Издательство: Cambridge Academ Рейтинг: Цена: 52790.00 T Наличие на складе: Невозможна поставка. Описание: Enumerative combinatorics deals with the basic problem of counting how many objects have a given property, a subject of great applicability. This book provides an introduction at a level suitable for graduate students. Extensive exercises with solutions show connections to other areas of mathematics.
Автор: Liu Yanpei Название: Enumerative Theory Of Maps ISBN: 0792355997 ISBN-13(EAN): 9780792355991 Издательство: Springer Рейтинг: Цена: 102480.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: As soon as the problem without considering the symmetry is solved for one kind of map, the general problem with symmetry can always, in principle, be solved from what we have known about the automorphism of a polyhedron, a synonym for a map, which can be determined efficiently according to another monograph of the present author [Liu58].
Автор: Gilbert Labelle; Pierre Leroux Название: Combinatoire enumerative ISBN: 3540172076 ISBN-13(EAN): 9783540172079 Издательство: Springer Рейтинг: Цена: 37220.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Korte, Bernhard, Vygen, Jens Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed. ISBN: 3642244874 ISBN-13(EAN): 9783642244872 Издательство: Springer Рейтинг: Цена: 60510.00 T Наличие на складе: Невозможна поставка. Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
