Geometry, Structure and Randomness in Combinatorics, Ji?? Matousek; Jaroslav Ne?et?il; Marco Pellegrini
Àâòîð: Flajolet Íàçâàíèå: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Èçäàòåëüñòâî: Cambridge Academ Ðåéòèíã: Öåíà: 88710.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications. Exercises, examples, appendices and notes aid understanding: ideal for individual self-study or for advanced undergraduate or graduate courses.
Àâòîð: Susan M. Cooper; Sean Sather-Wagstaff Íàçâàíèå: Connections Between Algebra, Combinatorics, and Geometry ISBN: 1493906259 ISBN-13(EAN): 9781493906253 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 167700.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.
Àâòîð: Susan M. Cooper; Sean Sather-Wagstaff Íàçâàíèå: Connections Between Algebra, Combinatorics, and Geometry ISBN: 1493948318 ISBN-13(EAN): 9781493948314 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 111790.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: Commutative algebra, combinatorics, and algebraic geometry are thriving areas of mathematical research with a rich history of interaction. Connections Between Algebra, Combinatorics, and Geometry contains lecture notes, along with exercises and solutions, from the Workshop on Connections Between Algebra and Geometry held at the University of Regina from May 29-June 1, 2012. It also contains research and survey papers from academics invited to participate in the companion Special Session on Interactions Between Algebraic Geometry and Commutative Algebra, which was part of the CMS Summer Meeting at the University of Regina held June 2-3, 2012, and the meeting Further Connections Between Algebra and Geometry, which was held at the North Dakota State University, February 23, 2013. This volume highlights three mini-courses in the areas of commutative algebra and algebraic geometry: differential graded commutative algebra, secant varieties, and fat points and symbolic powers. It will serve as a useful resource for graduate students and researchers who wish to expand their knowledge of commutative algebra, algebraic geometry, combinatorics, and the intricacies of their intersection.--
Àâòîð: V.A. Malyshev; A.M. Vershik Íàçâàíèå: Asymptotic Combinatorics with Application to Mathematical Physics ISBN: 1402007930 ISBN-13(EAN): 9781402007934 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 130430.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: Proceedings of the NATO Advanced Study Institute, held in St.Petersburg, Russia, 9-22 July 2001
Àâòîð: V.A. Malyshev; A.M. Vershik Íàçâàíèå: Asymptotic Combinatorics with Application to Mathematical Physics ISBN: 1402007922 ISBN-13(EAN): 9781402007927 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 153720.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: Proceedings of the NATO Advanced Study Institute, held in St.Petersburg, Russia, 9-22 July 2001
Àâòîð: Anton Betten; Axel Kohnert; Reinhard Laue; Alfred Íàçâàíèå: Algebraic Combinatorics and Applications ISBN: 3540411100 ISBN-13(EAN): 9783540411109 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 81050.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: Proceedings of a high-level conference on discrete mathematics, focusing on group actions in the areas of pure mathematics, applied mathematics, computer science, physics, and chemistry. A useful tool for researchers and graduate students in discrete mathematics and theoretical computer science.
Àâòîð: C.S. Calude; M.J. Dinneen; S. Sburlan Íàçâàíèå: Combinatorics, Computability and Logic ISBN: 1852335262 ISBN-13(EAN): 9781852335267 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 121110.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: This volume contains the papers presented at the Third Combinatorics, Computability and Logic (DMTCS`01) conference, These papers cover topics such as abstract data types and specifications algorithms and data structures automata and formal languages computability among others.
Àâòîð: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia Íàçâàíèå: Discrete Geometry, Combinatorics and Graph Theory ISBN: 3540706658 ISBN-13(EAN): 9783540706656 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 65210.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi`an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.
Àâòîð: S. B. Rao Íàçâàíèå: Combinatorics and Graph Theory ISBN: 3540111514 ISBN-13(EAN): 9783540111511 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 46540.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.
Àâòîð: 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.
Àâòîð: Matousek Jiri, Björner A., Ziegler G.M. Íàçâàíèå: Using the Borsuk-Ulam Theorem / Lectures on Topological Methods in Combinatorics and Geometry ISBN: 3540003622 ISBN-13(EAN): 9783540003625 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 55890.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. They are scattered in research papers or outlined in surveys, and they often use topological notions not commonly known among combinatorialists or computer scientists.This book is the first textbook treatment of a significant part of such results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level (for example, homology theory and homotopy groups are completely avoided). No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained. This text started with a one-semester graduate course the author taught in fall 1993 in Prague. The transcripts of the lectures by the participants served as a basis of the first version. Some years later, a course partially based on that text was taught by Günter M. Ziegler in Berlin. The book is based on a thoroughly rewritten version prepared during a pre-doctoral course the author taught at the ETH Zurich in fall 2001.Most of the material was covered in the course: Chapter 1 was assigned as an introductory reading text, and the other chapters were presented in approximately 30 hours of teaching (by 45 minutes), with some omissions throughout and with only a sketchy presentation of the last chapter.
Àâòîð: Kalai, Gil; Ziegler, Gunter M. (Eds.) Íàçâàíèå: Polytopes - combinatorics and computation ISBN: 3764363517 ISBN-13(EAN): 9783764363512 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 32560.00 T Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç. Îïèñàíèå: Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures.
