General Theory of Information Transfer and Combinatorics, Rudolf Ahlswede; Lars B?umer; Ning Cai; Harout Ayd
Автор: Flajolet Название: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Издательство: Cambridge Academ Рейтинг: Цена: 13306.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Harris, John Hirst, Jeffry L. Mossinghoff, Michael Название: Combinatorics and graph theory ISBN: 0387797106 ISBN-13(EAN): 9780387797106 Издательство: Springer Рейтинг: Цена: 5723.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covers a wide variety of topics in combinatorics and graph theory. This book includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. It also includes sections in graph theory on distance, Eulerian trails, and hamiltonian paths.
Автор: Author Unknown Название: HANDBOOK OF COMBINATORICS VOLUME 1,I ISBN: 0444823468 ISBN-13(EAN): 9780444823465 Издательство: Elsevier Science Рейтинг: Цена: 28633.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers finite sets and relations, matroids, symmetric structures, and combinatorial structures in geometry and number theory.
Автор: Kalai, Gil; Ziegler, Gunter M. (Eds.) Название: Polytopes - combinatorics and computation ISBN: 3764363517 ISBN-13(EAN): 9783764363512 Издательство: Springer Рейтинг: Цена: 4884.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures.
Автор: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia Название: Discrete Geometry, Combinatorics and Graph Theory ISBN: 3540706658 ISBN-13(EAN): 9783540706656 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi`an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.
This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.
Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.
New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.
The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.
The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.
The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.
The previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
