Extremal Combinatorics, Stasys Jukna

Автор: 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.

Автор: Tao, Terence Vu, Van H.
Название: Additive combinatorics
ISBN: 0521136563 ISBN-13(EAN): 9780521136563
Издательство: Cambridge Academ
Рейтинг:
Цена: 60190.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The many different tools from different fields that are used in additive combinatorics are brought together in a self-contained and systematic manner. This graduate-level 2006 text will quickly allow students and researchers easy entry into the fascinating field of additive combinatorics.

Автор: 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.

Автор: Soberon Bravo Pablo
Название: Problem-solving Methods in Combinatorics
ISBN: 3034805969 ISBN-13(EAN): 9783034805964
Издательство: Springer
Рейтинг:
Цена: 60550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Yearly math olympiads include at least one combinatrics problem. This book reviews problem-solving techniques for tackling such problems, with examples from recent contests. Includes problems for each topic, with hints and full solutions for reader practice.

Автор: 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.

Автор: Blackburn
Название: Surveys in Combinatorics 2013
ISBN: 1107651956 ISBN-13(EAN): 9781107651951
Издательство: Cambridge Academ
Рейтинг:
Цена: 59130.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book consists of nine survey papers by internationally renowned mathematicians. It will be of interest to researchers in combinatorics, from graduate students who want an overview of several areas to advanced researchers who want to have an in-depth analysis of recent developments.

Автор: Jukna Stasys
Название: Extremal Combinatorics / With Applications in Computer Science
ISBN: 3540663134 ISBN-13(EAN): 9783540663133
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Поставка под заказ.
Описание: The book is a concise, self-contained and up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called gems of the theory. A wide spectrum of most powerful combinatorial tools is presented: methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A throughout discussion of some recent applications to computer science motivates the liveliness and inherent usefulness of these methods to approach problems outside combinatorics. No special combinatorial or algebraic background is assumed. All necessary elements of linear algebra and discrete probability are introduced before their combinatorial applications. Aimed primarily as an introductory text for graduates, it provides also a compact source of modern extremal combinatorics for researchers in computer science and other fields of discrete mathematics.

Автор: 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.