Автор: Melvyn B. Nathanson Название: Combinatorial and Additive Number Theory II ISBN: 3319885340 ISBN-13(EAN): 9783319885346 Издательство: Springer Рейтинг: Цена: 34937.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 peer-reviewed and edited papers on current topics in number theory.
Автор: Marshall Hall Название: Combinatorial Theory 2nd Edition ISBN: 0471315184 ISBN-13(EAN): 9780471315186 Издательство: Wiley Рейтинг: Цена: 26286.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This introductory textbook examines the theory of combinatorics. It includes proof of Van der Waerden`s 1926 conjecture on permanents, Wilson`s theorem on asymptotic existence, and covers coding theory and its important connection with designs, problems of enumeration, and partition.
Автор: Ilijas Farah Название: Combinatorial Set Theory of C*-algebras ISBN: 3030270912 ISBN-13(EAN): 9783030270919 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book explores and highlights the fertile interaction between logic and operator algebras, which in recent years has led to the resolution of several long-standing open problems on C*-algebras. The interplay between logic and operator algebras (C*-algebras, in particular) is relatively young and the author is at the forefront of this interaction. The deep level of scholarship contained in these pages is evident and opens doors to operator algebraists interested in learning about the set-theoretic methods relevant to their field, as well as to set-theorists interested in expanding their view to the non-commutative realm of operator algebras. Enough background is included from both subjects to make the book a convenient, self-contained source for students. A fair number of the exercises form an integral part of the text. They are chosen to widen and deepen the material from the corresponding chapters. Some other exercises serve as a warmup for the latter chapters.
Автор: Alexander Ahlswede; Rudolf Ahlswede; Ingo Alth?fer Название: Combinatorial Methods and Models ISBN: 3319531379 ISBN-13(EAN): 9783319531373 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Поставка под заказ.
Описание: Whereas the first part of the book concentrates on combinatorial methods in order to analyse classical codes as prefix codes or codes in the Hamming metric, the second is devoted to combinatorial models in Information Theory.
Автор: Mustafa Akg?l; Horst W. Hamacher; S?leyman T?fekci Название: Combinatorial Optimization ISBN: 3642774911 ISBN-13(EAN): 9783642774911 Издательство: Springer Рейтинг: Цена: 14673.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: One of the primary goals of NATO ASIs is to bring together a group of scientists and research scientists primarily from the NATO countries for the dissemination of ad- vanced scientific knowledge and the promotion of international contacts among scientists.
Автор: Mauro Di Nasso; Isaac Goldbring; Martino Lupini Название: Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory ISBN: 3030179559 ISBN-13(EAN): 9783030179557 Издательство: Springer Рейтинг: Цена: 5589.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The goal of this monograph is to give an accessible introduction to nonstandard methods and their applications, with an emphasis on combinatorics and Ramsey theory. It includes both new nonstandard proofs of classical results and recent developments initially obtained in the nonstandard setting. This makes it the first combinatorics-focused account of nonstandard methods to be aimed at a general (graduate-level) mathematical audience. This book will provide a natural starting point for researchers interested in approaching the rapidly growing literature on combinatorial results obtained via nonstandard methods. The primary audience consists of graduate students and specialists in logic and combinatorics who wish to pursue research at the interface between these areas.
Автор: Alexander Ahlswede; Rudolf Ahlswede; Ingo Alth?fer Название: Combinatorial Methods and Models ISBN: 3319850733 ISBN-13(EAN): 9783319850733 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Поставка под заказ.
Описание:
The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.A code can be regarded combinatorially as a hypergraph; and many coding theorems can be obtained by appropriate colourings or coverings of the underlying hypergraphs. Several such colouring and covering techniques and their applications are introduced in this book. Furthermore, codes produced by permutations and one of Ahlswede’s favourite research fields -- extremal problems in Combinatorics -- are presented. Whereas the first part of the book concentrates on combinatorial methods in order to analyse classical codes as prefix codes or codes in the Hamming metric, the second is devoted to combinatorial models in Information Theory. Here the code concept already relies on a rather combinatorial structure, as in several concrete models of multiple access channels or more refined distortions. An analytical tool coming into play, especially during the analysis of perfect codes, is the use of orthogonal polynomials.
Classical information processing concerns the main tasks of gaining knowledge and the storage, transmission and hiding of data. The first task is the prime goal of Statistics. For transmission and hiding data, Shannon developed an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presented in this work are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs.
Автор: Aarts E Название: Local Search in Combinatorial Optimization ISBN: 0691115222 ISBN-13(EAN): 9780691115221 Издательство: Princeton UP Рейтинг: Цена: 9882.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covers local search and its variants from both a theoretical and practical point of view. This book is suitable for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science.
Автор: Ding-Zhu Du; Panos M. Pardalos; Zhao Zhang Название: Nonlinear Combinatorial Optimization ISBN: 3030161935 ISBN-13(EAN): 9783030161934 Издательство: Springer Рейтинг: Цена: 11878.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graduate students and researchers in applied mathematics, optimization, engineering, computer science, and management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts.
Автор: Ding-Zhu Du; Panos M. Pardalos Название: Handbook of Combinatorial Optimization ISBN: 1441936661 ISBN-13(EAN): 9781441936660 Издательство: Springer Рейтинг: Цена: 32004.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
Автор: Ding-Zhu Du; Panos M. Pardalos Название: Handbook of Combinatorial Optimization ISBN: 1441948139 ISBN-13(EAN): 9781441948137 Издательство: Springer Рейтинг: Цена: 27251.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g.
Автор: Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv Название: Geometric Algorithms and Combinatorial Optimization ISBN: 3642782426 ISBN-13(EAN): 9783642782428 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
