From Combinatorics to Philosophy, Ernesto Damiani; Ottavio D`Antona; Vincenzo Marra;
Автор: Flajolet Название: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Издательство: Cambridge Academ Рейтинг: Цена: 13306.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Richard Stanley Название: Enumerative Combinatorics ISBN: 146159765X ISBN-13(EAN): 9781461597650 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Richard P. Stanley Название: Algebraic Combinatorics ISBN: 1489992855 ISBN-13(EAN): 9781489992857 Издательство: Springer Рейтинг: Цена: 5589.00 р. Наличие на складе: Поставка под заказ.
Описание: Written by an expert in the field, this undergraduate textbook will prepare the next generation of pure and applied mathematicians. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, and the Sperner property.
Автор: Harris John M. Название: Combinatorics and Graph Theory ISBN: 1441927239 ISBN-13(EAN): 9781441927231 Издательство: Springer Цена: 5723.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There are certain rules that one must abide by in order to create a successful sequel. -- Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of changes to the text in this second edition. In the new edition, we continue to introduce new topics with concrete - amples, we provide complete proofs of almost every result, and we preserve the book'sfriendlystyle andlivelypresentation, interspersingthetextwith occasional jokes and quotations. The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order. Chapter 3, on in nite combinatorics and graphs, may also be studied independently, although many readers will want to investigate trees, matchings, and Ramsey theory for nite sets before exploring these topics for in nite sets in the third chapter. Like the rst edition, this text is aimed at upper-division undergraduate students in mathematics, though others will nd much of interest as well. It assumes only familiarity with basic proof techniques, and some experience with matrices and in nite series. The second edition offersmany additionaltopics for use in the classroom or for independentstudy. Chapter 1 includesa new sectioncoveringdistance andrelated notions in graphs, following an expanded introductory section. This new section also introduces the adjacency matrix of a graph, and describes its connection to important features of the graph.
Автор: Mahir Can; Zhenheng Li; Benjamin Steinberg; Qiang Название: Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics ISBN: 1493956000 ISBN-13(EAN): 9781493956005 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: "The Fields Institute for Research in the Mathematical Sciences."
Описание: Contains research and expository papers in various topics including Number Theory, Special Functions, Physics and Combinatorics. This title also covers the developments in the fields of q-series. It is intended for researchers and graduate students interested in the developments in q-series and symbolic computation.
Автор: Kalai, Gil; Ziegler, Gunter M. (Eds.) Название: Polytopes - combinatorics and computation ISBN: 3764363517 ISBN-13(EAN): 9783764363512 Издательство: Springer Рейтинг: Цена: 4884.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Описание: Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.
Автор: Ding-Zhu Du; Guochuan Zhang Название: Computing and Combinatorics ISBN: 3642387675 ISBN-13(EAN): 9783642387678 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.
Название: Walk Through Combinatorics ISBN: 9814460001 ISBN-13(EAN): 9789814460002 Издательство: World Scientific Publishing Рейтинг: Цена: 7603.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity.As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
