Автор: Tao, Terence Vu, Van H. Название: Additive combinatorics ISBN: 0521136563 ISBN-13(EAN): 9780521136563 Издательство: Cambridge Academ Рейтинг: Цена: 9029.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Bona Miklos Название: Introduction to Enumerative and Analytic Combinatorics ISBN: 148224909X ISBN-13(EAN): 9781482249095 Издательство: Taylor&Francis Рейтинг: Цена: 13320.00 р. Наличие на складе: Нет в наличии.
Описание:
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.
Описание: This two-volume work presents the main known equivalents to the Riemann hypothesis, perhaps the most important problem in mathematics. Volume 2 covers equivalents with a strong analytic orientation and is supported by an extensive set of appendices.
Автор: Harris, John Hirst, Jeffry L. Mossinghoff, Michael Название: Combinatorics and graph theory ISBN: 0387797106 ISBN-13(EAN): 9780387797106 Издательство: Springer Рейтинг: Цена: 4995.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.
Автор: Stanley Название: Enumerative Combinatorics ISBN: 1107602629 ISBN-13(EAN): 9781107602625 Издательство: Cambridge Academ Рейтинг: Цена: 5988.00 р. 8554.00-30% Наличие на складе: Есть (1 шт.) Описание: 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.
Автор: 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.
Автор: Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf Название: Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups ISBN: 3110413329 ISBN-13(EAN): 9783110413328 Издательство: Walter de Gruyter Цена: 6499.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata. Contents:Algebraic structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups
Автор: Gillman, Rick Название: Game Theoretic Modeling ISBN: 1482248093 ISBN-13(EAN): 9781482248098 Издательство: Taylor&Francis Рейтинг: Цена: 10258.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is an introductory game theory book that quickly moves readers through the fundamental ideas of game theory to enable them to engage in creative modeling projects based on game theoretic concepts.
Автор: Schaefer Название: Crossing Numbers Of Graphs ISBN: 1498750494 ISBN-13(EAN): 9781498750493 Издательство: Taylor&Francis Рейтинг: Цена: 18374.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science.
Название: Connections in discrete mathematics ISBN: 1316607887 ISBN-13(EAN): 9781316607886 Издательство: Cambridge Academ Рейтинг: Цена: 8554.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: For over fifty years, Ron Graham has been able to illuminate the common threads connecting different areas in discrete mathematics. Inspired by Graham, this collection of papers written by top researchers in discrete mathematics encompasses a broad range of topics from numbers and geometry to juggling and probability.
Автор: Steven R. Finch Название: Mathematical Constants II ISBN: 1108470599 ISBN-13(EAN): 9781108470599 Издательство: Cambridge Academ Рейтинг: Цена: 24077.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The author continues his outstanding scholarly attempt to bring together all significant mathematical constants in one place. Using this book, students and professionals will discover hidden links between apparently disconnected fields of inquiry. Unsolved problems - the lifeblood of mathematics - appear virtually everywhere as well.
Автор: Hiroshi Nagamochi, Toshihide Ibaraki Название: Algorithmic Aspects of Graph Connectivity ISBN: 1108735495 ISBN-13(EAN): 9781108735490 Издательство: Cambridge Academ Рейтинг: Цена: 6970.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
