Автор: Wengenroth Jochen Название: Derived Functors in Functional Analysis ISBN: 3540002367 ISBN-13(EAN): 9783540002369 Издательство: Springer Цена: 32560.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The text contains for the first time in book form the state of the art of homological methods in functional analysis like characterizations of the vanishing of the derived projective limit functor or the functors Ext1 (E, F) for Fr chet and more general spaces. The researcher in real and complex analysis finds powerful tools to solve surjectivity problems e.g. on spaces of distributions or to characterize the existence of solution operators.The requirements from homological algebra are minimized: all one needs is summarized on a few pages. The answers to several questions of V.P. Palamodov who invented homological methods in analysis also show the limits of the program.
Автор: Sten G. Kaijser; Joan w. Pelletier Название: Interpolation Functors and Duality ISBN: 3540167900 ISBN-13(EAN): 9783540167907 Издательство: Springer Рейтинг: Цена: 23280.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 113660.00 T Наличие на складе: Поставка под заказ. Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Автор: P.W. Michor Название: Functors and Categories of Banach Spaces ISBN: 3540087648 ISBN-13(EAN): 9783540087649 Издательство: Springer Рейтинг: Цена: 23250.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Joseph Bernstein; Valery Lunts Название: Equivariant Sheaves and Functors ISBN: 3540580719 ISBN-13(EAN): 9783540580713 Издательство: Springer Рейтинг: Цена: 23250.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Introducing the equivariant derived category of sheaves, this monograph also provides applications to the equivariant intersection cohomology. This theory should benefit specialists in representation theory, algebraic geometry or topology.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 121070.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: serge Bouc Название: Green Functors and G-sets ISBN: 3540635505 ISBN-13(EAN): 9783540635505 Издательство: Springer Рейтинг: Цена: 46540.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: A study of green functors and g-sets. It includes sections covering Mackey functors, green functors, the category associated to a green functor, morita equivalence and relative projectivity, construction of green functors, adjoint constructions, and the simple modules.
Автор: Franjou Vincent Название: Lectures on Functor Homology ISBN: 3319213040 ISBN-13(EAN): 9783319213040 Издательство: Springer Рейтинг: Цена: 65210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book features a series of lectures that explores three different fields in which functor homology (short for homological algebra in functor categories) has recently played a significant role.
Автор: Korte, Bernhard, Vygen, Jens Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed. ISBN: 3642244874 ISBN-13(EAN): 9783642244872 Издательство: Springer Рейтинг: Цена: 60510.00 T Наличие на складе: Невозможна поставка. Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
