Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  +7(7172) 65-23-70
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Graph Theory and Additive Combinatorics: Exploring Structure and Randomness, Yufei Zhao


Варианты приобретения
Цена: 58070.00T
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 4 шт.  Склад Америка: 200 шт.  
При оформлении заказа до: 2025-08-04
Ориентировочная дата поставки: Август-начало Сентября

Добавить в корзину
в Мои желания

Автор: Yufei Zhao
Название:  Graph Theory and Additive Combinatorics: Exploring Structure and Randomness
ISBN: 9781009310949
Издательство: Cambridge Academ
Классификация:



ISBN-10: 1009310941
Обложка/Формат: Hardback
Страницы: 338
Вес: 0.54 кг.
Дата издания: 31.08.2023
Язык: English
Иллюстрации: Worked examples or exercises
Размер: 318 x 277 x 41
Ключевые слова: Combinatorics & graph theory,Discrete mathematics,Number theory,Probability & statistics, MATHEMATICS / Discrete Mathematics
Подзаголовок: Exploring structure and randomness
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Англии
Описание: Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics. Readers will explore central results in additive combinatorics-notably the cornerstone theorems of Roth, Szemeredi, Freiman, and Green-Tao-and will gain additional insights into these ideas through graph theoretic perspectives. Topics discussed include the Turan problem, Szemeredis graph regularity method, pseudorandom graphs, graph limits, graph homomorphism inequalities, Fourier analysis in additive combinatorics, the structure of set addition, and the sum-product problem. Important combinatorial, graph theoretic, analytic, Fourier, algebraic, and geometric methods are highlighted. Students will appreciate the chapter summaries, many figures and exercises, and freely available lecture videos on MIT OpenCourseWare. Meant as an introduction for students and researchers studying combinatorics, theoretical computer science, analysis, probability, and number theory, the text assumes only basic familiarity with abstract algebra, analysis, and linear algebra.

Additive combinatorics

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

Additive combinatorics

Автор: Bajnok, Bela (gettysburg College, Usa)
Название: Additive combinatorics
ISBN: 0815353014 ISBN-13(EAN): 9780815353010
Издательство: Taylor&Francis
Рейтинг:
Цена: 49280.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Additive Combinatorics: A Menu of Research Problems is the first book of its kind in aims and scope: it provides readers with an opportunity to actively explore the relatively new field of additive combinatorics. The author has written it specifically for students of any background and proficiency level, from beginners to advanced researchers.

Geometry, Structure and Randomness in Combinatorics

Автор: Ji?? Matousek; Jaroslav Ne?et?il; Marco Pellegrini
Название: Geometry, Structure and Randomness in Combinatorics
ISBN: 8876425241 ISBN-13(EAN): 9788876425240
Издательство: Springer
Рейтинг:
Цена: 26090.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: ГЇВїВЅ This book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include: graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.

Compendium of food additive specifications (fao jecfa monographs)

Автор: Joint Fao/who Expert Committee On Food Additives Food And Agriculture Organization Council Of The Food & Agriculture Organization World Health Organiz
Название: Compendium of food additive specifications (fao jecfa monographs)
ISBN: 9251060657 ISBN-13(EAN): 9789251060650
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 28430.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Provides information on the identity and purity of food additives used directly in foods or in food production. The main objectives are to identify the food additives that have been subjected to testing for safety, to ensure that additives are of the quality required for use in food, and to encourage good manufacturing practice.

Structure and randomness in computability and set theory

Название: Structure and randomness in computability and set theory
ISBN: 9813228229 ISBN-13(EAN): 9789813228221
Издательство: World Scientific Publishing
Рейтинг:
Цена: 126720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

This volume presents some exciting new developments occurring on the interface between set theory and computability as well as their applications in algebra, analysis and topology. These include effective versions of Borel equivalence, Borel reducibility and Borel determinacy. It also covers algorithmic randomness and dimension, Ramsey sets and Ramsey spaces. Many of these topics are being discussed in the NSF-supported annual Southeastern Logic Symposium.


Contents: Limits of the Kucerea-Gacs Coding Method (George Barmpalias and Andrew Lewis-Pye); Infinitary partition properties of sums of selective ultrafilters (Andreas Blass); Semiselective Coideals and Ramsey Sets (Carlos DiPrisco and Leonardo Pacheco); Survey on Topological Ramsey Spaces Dense in Forcings (Natasha Dobrinen); Higher Computability in the Reverse Mathematics of Borel Determinacy (Sherwood Hachtman); Computability and Definability (Valentina Harizanov); A Ramsey Space of Infinite Polyhedra and the Random Polyhedron (Jose G Mijares Palacios and Gabriel Padilla); Computable Reducibility for Cantor Space (Russell G Miller); Information vs Dimension - An Algorithmic Perspective (Jan Reimann);


Readership: Graduate students and researchers interested in the interface between set theory and computability.

Decision Systems and Nonstochastic Randomness

Автор: V. I. Ivanenko
Название: Decision Systems and Nonstochastic Randomness
ISBN: 144195547X ISBN-13(EAN): 9781441955470
Издательство: Springer
Рейтинг:
Цена: 111790.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents the first mathematical formalization of the statistical regularities of non-stochastic randomness and demonstrates how these regularities extend the standard probability-based model of decision making under uncertainty, allowing for the description of uncertain mass events that do not fit standard stochastic models.

Isotopic Randomness and Self-Organization: In Physics, Biology, Nanotechnology, and Digital Informatics

Автор: Berezin Alexander
Название: Isotopic Randomness and Self-Organization: In Physics, Biology, Nanotechnology, and Digital Informatics
ISBN: 3110605058 ISBN-13(EAN): 9783110605051
Издательство: Walter de Gruyter
Цена: 234410.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Information and Randomness

Автор: Cristian S. Calude
Название: Information and Randomness
ISBN: 3642077935 ISBN-13(EAN): 9783642077937
Издательство: Springer
Рейтинг:
Цена: 74490.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The first edition of the monograph Information and Randomness: An Algorithmic Perspective by Crist ian Calude was published in 1994. In my Foreword I said: "The research in algorithmic information theory is already some 30 years old. However, only the recent years have witnessed a really vigorous growth in this area. . . . The present book by Calude fits very well in our series. Much original research is presented. . . making the approach richer in consequences than the classical one. Remarkably, however, the text is so self-contained and coherent that the book may also serve as a textbook. All proofs are given in the book and, thus, it is not necessary to consult other sources for classroom instruction. " The vigorous growth in the study of algorithmic information theory has continued during the past few years, which is clearly visible in the present second edition. Many new results, examples, exercises and open prob- lems have been added. The additions include two entirely new chapters: "Computably Enumerable Random Reals" and "Randomness and Incom- pleteness". The really comprehensive new bibliography makes the book very valuable for a researcher. The new results about the characterization of computably enumerable random reals, as well as the fascinating Omega Numbers, should contribute much to the value of the book as a textbook. The author has been directly involved in these results that have appeared in the prestigious journals Nature, New Scientist and Pour la Science.

Abrahamic Reflections on Randomness and Providence

Автор: Clark Kelly James, Koperski Jeffrey
Название: Abrahamic Reflections on Randomness and Providence
ISBN: 303075796X ISBN-13(EAN): 9783030757960
Издательство: Springer
Рейтинг:
Цена: 37260.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This open access book addresses the question of how God can providentially govern apparently ungovernable randomness. Medieval theologians confidently held that God is provident, that is, God is the ultimate cause of or is responsible for everything that happens.

Coarse Geometry and Randomness

Автор: Itai Benjamini
Название: Coarse Geometry and Randomness
ISBN: 3319025759 ISBN-13(EAN): 9783319025759
Издательство: Springer
Рейтинг:
Цена: 32600.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Isoperimetry and expansions in graphs.- Several metric notions.- The hyperbolic plane and hyperbolic graphs.- More on the structure of vertex transitive graphs.- Percolation on graphs.- Local limits of graphs.- Random planar geometry.- Growth and isoperimetric profile of planar graphs.- Critical percolation on non-amenable groups.- Uniqueness of the infinite percolation cluster.- Percolation perturbations.- Percolation on expanders.- Harmonic functions on graphs.- Nonamenable Liouville graphs.


Exploring RANDOMNESS

Автор: Gregory J. Chaitin
Название: Exploring RANDOMNESS
ISBN: 1447110854 ISBN-13(EAN): 9781447110859
Издательство: Springer
Рейтинг:
Цена: 102480.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This essential companion to Chaitin`s successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The LISP code for this book is available at the author`s Web site together with a Java applet LISP interpreter.

Randomness

Автор: Blokes Random
Название: Randomness
ISBN: 0464080797 ISBN-13(EAN): 9780464080794
Издательство: Неизвестно
Рейтинг:
Цена: 73760.00 T
Наличие на складе: Невозможна поставка.
Описание: If you love a world of random event brings you endless joy than this is the photo book for your amazing collection.


Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия