Combinatorial Algebra: Syntax and Semantics, Mark V. Sapir; Victor S. Guba; Mikhail V. Volkov
Название: Combinatorial methods in topology and algebra ISBN: 3319201549 ISBN-13(EAN): 9783319201542 Издательство: Springer Рейтинг: Цена: 79190.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Combinatorics plays a prominent role in contemporary mathematics, due to the vibrant development it has experienced in the last two decades and its many interactions with other subjects.This book arises from the INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra,`` which was held in Cortona in September 2013.
Автор: 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.
Автор: 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.
Автор: Zsuzsanna Lipt?k; William F. Smyth Название: Combinatorial Algorithms ISBN: 3319295152 ISBN-13(EAN): 9783319295152 Издательство: Springer Рейтинг: Цена: 52170.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the thoroughly refereedpost-workshop proceedings for the 26 International Workshop on combinatorialAlgorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions.
Автор: Mark V. Sapir; Victor S. Guba; Mikhail V. Volkov Название: Combinatorial Algebra: Syntax and Semantics ISBN: 3319375903 ISBN-13(EAN): 9783319375908 Издательство: Springer Рейтинг: Цена: 55890.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod-Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass-Guivarc'h theorem about growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata.
With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified audience. No prerequisites beyond standard courses in linear and abstract algebra are required. The broad appeal of this textbook extends to a variety of student levels: from advanced high-schoolers to undergraduates and graduate students, including those in search of a Ph.D. thesis who will benefit from the "Further reading and open problems" sections at the end of Chapters 2 -5.
The book can also be used for self-study, engaging those beyond t
he classroom setting: researchers, instructors, students, virtually anyone who wishes to learn and better understand this important area of mathematics.
Автор: Bruno Benedetti; Emanuele Delucchi; Luca Moci Название: Combinatorial Methods in Topology and Algebra ISBN: 3319369989 ISBN-13(EAN): 9783319369983 Издательство: Springer Рейтинг: Цена: 65210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Combinatorics plays a prominent role in contemporary mathematics, due to the vibrant development it has experienced in the last two decades and its many interactions with other subjects.This book arises from the INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra,`` which was held in Cortona in September 2013.
Автор: Richard A. Brualdi; Shmuel Friedland; Victor Klee Название: Combinatorial and Graph-Theoretical Problems in Linear Algebra ISBN: 1461383560 ISBN-13(EAN): 9781461383567 Издательство: Springer Рейтинг: Цена: 111790.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This IMA Volume in Mathematics and its Applications COMBINATORIAL AND GRAPH-THEORETICAL PROBLEMS IN LINEAR ALGEBRA is based on the proceedings of a workshop that was an integral part of the 1991-92 IMA program on "Applied Linear Algebra."
Автор: Gunnar Fl?ystad; Trygve Johnsen; Andreas Leopold K Название: Combinatorial Aspects of Commutative Algebra and Algebraic Geometry ISBN: 3642268285 ISBN-13(EAN): 9783642268281 Издательство: Springer Рейтинг: Цена: 153720.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The Abel Symposium 2009 "Combinatorial aspects of Commutative Algebra and Algebraic Geometry", held at Voss, Norway, featured talks by leading researchers in the field. This is the proceedings of the Symposium, presenting contributions on syzygies, tropical geometry, Boij-Soederberg theory, Schubert calculus, and quiver varieties.
Автор: L.A. Bokut`; G.P.. Kukin Название: Algorithmic and Combinatorial Algebra ISBN: 0792323130 ISBN-13(EAN): 9780792323136 Издательство: Springer Рейтинг: Цена: 102480.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This volume presents an authoritative overview of developments in algorithmic and combinatorial algebra which have been achieved during the past 40 years, with an emphasis on the results obtained by the Novosibirsk school of A.I. Mal`tchev and A.I. Shirshov and followers.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 121070.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Goldberg Название: Efficient Algorithms for Listing Combinatorial Structures ISBN: 0521450217 ISBN-13(EAN): 9780521450218 Издательство: Cambridge Academ Рейтинг: Цена: 116160.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Some related work is also included which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
