Finite and Infinite Combinatorics in Sets and Logic, Norbert W Sauer; R.E. Woodrow; B. Sands

Автор: 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.

Автор: Stanley
Название: Enumerative Combinatorics
ISBN: 1107602629 ISBN-13(EAN): 9781107602625
Издательство: Cambridge Academ
Рейтинг:
Цена: 5988.00 р. 8554.00 -30%
Наличие на складе: Есть (1 шт.)
Описание: Richard Stanley`s two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes more than 300 new exercises, many with solutions, updated and expanded chapter bibliographies and substantial new material on permutation statistics.

Автор: George E. Martin
Название: Counting: The Art of Enumerative Combinatorics
ISBN: 1441929150 ISBN-13(EAN): 9781441929150
Издательство: Springer
Рейтинг:
Цена: 7819.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...For example, How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available? At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to color the faces of a cube if k colors are available with each face having exactly one color? or How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? Since there are no prerequisites, this book can be used for college courses in combinatorics at the sophomore level for either computer science or mathematics students. The first five chapters have served as the basis for a graduate course for in-service teachers. Chapter 8 introduces graph theory.

Автор: Anders Bjorner; Francesco Brenti
Название: Combinatorics of Coxeter Groups
ISBN: 3642079229 ISBN-13(EAN): 9783642079221
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Includes a rich variety of exercises to accompany the exposition of Coxeter groups Coxeter groups have already been exposited from algebraic and geometric perspectives, but this book will be presenting the combinatorial aspects of Coxeter groups

Автор: Tao Jiang; D.T. Lee
Название: Computing and Combinatorics
ISBN: 354063357X ISBN-13(EAN): 9783540633570
Издательство: Springer
Рейтинг:
Цена: 12577.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The proceedings of the Third Annual International Conference on Computing and Combinatorics, COCOON `97. The papers in this volume are organized in sections which include parallel and distributed computing, computational geometry, complexity, computation biology, and computability.

Автор: Daniel Krob; Alexander A. Mikhalev; Alexander V. M
Название: Formal Power Series and Algebraic Combinatorics
ISBN: 3540672478 ISBN-13(EAN): 9783540672470
Издательство: Springer
Рейтинг:
Цена: 33401.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences that are held annually since 1988, alternating between Europe and North America. They usually take place at the end of the academic year, between June and July depending on the local organizing constraints. SFCA/FPSAC has now become one of the most important annual inter- national meetings for the algebraic and bijective combinatorics community. The conference is indeed one of the key international exchange place of ideas between all researchers involved in this emerging exciting area. SFCA/FPSAC'OO is the 12th in the series. It will take place in Moscow (Russia) from June 26 to June 30, 2000. Previous SFCA/FPSAC conferences were organized in Lille (88), Paris (90), Bordeaux (91), Montreal (92), Florence (93), Rutgers (94), Marne-la-Vallee (95), Minneapolis (96), Vienna (97), Toronto (98) and Barcelona (99). SFCA/FPSAC'OO is co-organized by the Center of New Information Tech- nologies (CNIT) of Moscow State University, the Laboratoire d'Informatique AI- gorithmique: Fondements et Applications (LIAFA) of University Paris 7 and the Maison de l'Informatique et des Mathematiques Discretes (MIMD). The SFCA/FPSAC'OO conference covers all main areas of algebraic combi- natorics and bijective combinatorics (including asymptotic analysis, all sorts of enumeration, representation theory of classical groups and classical Lie algebras, symmetric functions, etc). A special stress was also put this year on combinato- rial and computer algebra.

Автор: Michel M. Deza; Reinhardt Euler; Ioannis Manoussak
Название: Combinatorics and Computer Science
ISBN: 3540615768 ISBN-13(EAN): 9783540615767
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume comprises a collection of 33 full papers on combinatorics and computer science, selected from 54 papers accepted for presentation at the joint Eighth Franco-Japanese and Fourth Franco-Chinese Conference on Combinatorics in Computer Science, CCS `96.

Автор: Klaus Johannson
Название: Topology and Combinatorics of 3-Manifolds
ISBN: 3540590633 ISBN-13(EAN): 9783540590637
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This study of the combinatorial structures of 3-manifolds focuses specifically on Heegard graphs in Haken 3-manifolds. These graphs fix not only a combinatorial structure, but also a presentation for the fundamental group of the underlying 3-manifold.

Автор: Volker Diekert
Название: Combinatorics on Traces
ISBN: 3540530312 ISBN-13(EAN): 9783540530312
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Presents a comprehensive study of Mazurkiewicz` trace theory from an algebraic-combinatorial point of view. This theory is recognized as a tool for a rigorous mathematical treatment of concurrent systems.

Автор: Oscar H. Ibarra; Louxin Zhang
Название: Computing and Combinatorics
ISBN: 354043996X ISBN-13(EAN): 9783540439967
Издательство: Springer
Рейтинг:
Цена: 16070.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: These are the refereed proceedings of the 8th Annual International Computing and Combinatorics Conference, COCOON 2002, held in Singapore in August 2002.

Автор: Anton Betten; Axel Kohnert; Reinhard Laue; Alfred
Название: Algebraic Combinatorics and Applications
ISBN: 3540411100 ISBN-13(EAN): 9783540411109
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.