Combinatorics, Words and Symbolic Dynamics, Berth?
Автор: 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.
Автор: M. Lothaire Название: Applied Combinatorics on Words ISBN: 0521848024 ISBN-13(EAN): 9780521848022 Издательство: Cambridge Academ Рейтинг: Цена: 26136.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The aim of this volume is to present a unified treatment of some of the major fields of applications of combinatorics. Areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and several areas of applied mathematics such as combinatorial enumeration and fractal analysis.
Описание: A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. They are scattered in research papers or outlined in surveys, and they often use topological notions not commonly known among combinatorialists or computer scientists.This book is the first textbook treatment of a significant part of such results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level (for example, homology theory and homotopy groups are completely avoided). No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained. This text started with a one-semester graduate course the author taught in fall 1993 in Prague. The transcripts of the lectures by the participants served as a basis of the first version. Some years later, a course partially based on that text was taught by GГјnter M. Ziegler in Berlin. The book is based on a thoroughly rewritten version prepared during a pre-doctoral course the author taught at the ETH Zurich in fall 2001.Most of the material was covered in the course: Chapter 1 was assigned as an introductory reading text, and the other chapters were presented in approximately 30 hours of teaching (by 45 minutes), with some omissions throughout and with only a sketchy presentation of the last chapter.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
