Combinatorics, W. D. Wallis; A. P. Street; J. S. Wallis
Автор: J. H. van Lint Название: A Course in Combinatorics ISBN: 0521006015 ISBN-13(EAN): 9780521006019 Издательство: Cambridge Academ Рейтинг: Цена: 10454.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics deals with ways of arranging and distributing mathematical objects, and involves ideas from geometry, algebra and analysis. The theory has broad applications, including codes, circuit design and algorithm complexity. Graph theory, enumeration, external problems, projective geometry, designs, colourings and codes, amongst others, are dealt with in a unified way.
Автор: Yixin Cao; Jianer Chen Название: Computing and Combinatorics ISBN: 3319623885 ISBN-13(EAN): 9783319623887 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The papers cover various topics, including algorithms and data structures, complexity theory and computability, algorithmic game theory, computational learning theory, cryptography, computationalbiology, computational geometry and number theory, graph theory, and parallel and distributed computing.
Автор: Bump Daniel Et Al Название: Crystal Bases: Representations And Combinatorics ISBN: 981473344X ISBN-13(EAN): 9789814733441 Издательство: World Scientific Publishing Рейтинг: Цена: 7603.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This unique book provides the first introduction to crystal base theory from the combinatorial point of view.
Автор: Bump Daniel Et Al Название: Crystal Bases: Representations And Combinatorics ISBN: 9814733431 ISBN-13(EAN): 9789814733434 Издательство: World Scientific Publishing Рейтинг: Цена: 15523.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This unique book provides the first introduction to crystal base theory from the combinatorial point of view.
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.
Автор: Dinh Название: Computing and Combinatorics ISBN: 3319426338 ISBN-13(EAN): 9783319426334 Издательство: Springer Рейтинг: Цена: 11460.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Scheduling Algorithms and Circuit Complexity;
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
