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

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

Автор: George P?lya; Robert E. Tarjan; Donald R. Woods
Название: Notes on Introductory Combinatorics
ISBN: 0817649522 ISBN-13(EAN): 9780817649524
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Polya and Tarjan at Stanford University...One can count on Polya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory... The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading."

Автор: W. D. Wallis; A. P. Street; J. S. Wallis
Название: Combinatorics
ISBN: 3540060359 ISBN-13(EAN): 9783540060352
Издательство: Springer
Рейтинг:
Цена: 6282.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Jin-Yi Cai; C.K. Wong
Название: Computing and Combinatorics
ISBN: 3540613323 ISBN-13(EAN): 9783540613329
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics. The 44 papers, presented in revised version, describe current research results from various areas of theoretical computer science and combinatorics related to computing.

Автор: Wen-Lian Hsu; Ming-Yang Kao
Название: Computing and Combinatorics
ISBN: 3540648240 ISBN-13(EAN): 9783540648246
Издательство: Springer
Рейтинг:
Цена: 11179.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: M. Aigner
Название: Higher Combinatorics
ISBN: 9027707952 ISBN-13(EAN): 9789027707956
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Proceedings of the NATO Advanced Study Institute, Berlin, Germany, September 1-10, 1976

Автор: Ding-Zhu Du; Peter Eades; Vladimir Estivill-Castro
Название: Computing and Combinatorics
ISBN: 3540677879 ISBN-13(EAN): 9783540677871
Издательство: Springer
Рейтинг:
Цена: 12577.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text constitutes the refereed proceedings of the 6th Annual International Conference on Computing and Combinatorics, COCOON 2000, held in Sydney, Australia in July 2000.

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

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

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

Автор: Ding-Zhu Du; Ming Li
Название: Computing and Combinatorics
ISBN: 354060216X ISBN-13(EAN): 9783540602163
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: These conference proceedings cover all current aspects of theoretical computer science and combinatorial mathematics related to computing. In particular, there are sections on complexity theory, graph drawing, computational geometry, databases, graph algorithms and distributed programming.

Автор: Norbert W Sauer; R.E. Woodrow; B. Sands
Название: Finite and Infinite Combinatorics in Sets and Logic
ISBN: 0792324226 ISBN-13(EAN): 9780792324225
Издательство: Springer
Рейтинг:
Цена: 56042.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Highlights the connections between problems in finite combinatorics and graph theory on the one hand and the more foundational subjects of logic and set theory on the other. This book contains articles which touch in one way or another on homogeneous structures.