Описание: Studies a different type of eigenvalue problem, one that is very useful for applications: eigenvalue problems related to hemivariational inequalities, that is involving nonsmooth, nonconvex, energy functions. This book also studies nonresonant and resonant cases both for static and dynamic problems.
Автор: Tadahito Harima; Toshiaki Maeno; Hideaki Morita; Y Название: The Lefschetz Properties ISBN: 3642382053 ISBN-13(EAN): 9783642382055 Издательство: Springer Рейтинг: Цена: 4207 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is a monograph which collects basic techniques, major results and interesting applications of Lefschetz properties of Artinian algebras.
Описание: The explanation of the duality of Kerdock and Preparata codes is related to the discovery of large sets of quadriphase sequences over Z4 whose correlation properties are better than those of the best binary sequences. This title contains descriptions of the connection between difference sets, sequences and correlation properties of sequences.
Описание: The explanation of the formal duality of Kerdock and Preparata codes is related to the discovery of large sets of quadriphase sequences over Z4 whose correlation properties are better than those of the best binary sequences. This title describes the connection between difference sets, sequences and correlation properties of sequences.
Автор: Nagamochi, Hiroshi Ibaraki, Toshihide Название: Algorithmic aspects of graph connectivity ISBN: 0521878640 ISBN-13(EAN): 9780521878647 Издательство: Cambridge Academ Рейтинг: Цена: 8117 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.
Автор: Li Название: Generalized Connectivity of Graphs ISBN: 3319338277 ISBN-13(EAN): 9783319338279 Издательство: Springer Рейтинг: Цена: 4674 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru