• формат pdf
  • размер 2.17 МБ
  • добавлен 29 января 2011 г.
Kung J.P., Rota G.-C., Yan C.H. Combinatorics: The Rota Way
Cambridge University Press, 2009. - 408 pages.

Written by two of Gian-Carlo Rota's former students, this book is based on notes from his courses and on personal discussions with him. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Speer theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. This book should be on the shelf of all students and researchers in combinatorics and related areas.
Смотрите также

Bergeron F. Algebraic Combinatorics and Coinvariant Spaces

  • формат pdf
  • размер 7.43 МБ
  • добавлен 12 мая 2011 г.
A K Peters/CRC, 2009. - 230 pages. Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the most important current research in the field, this book provides an intensive, yet accessible, introduction to the subject of algebraic combinatorics. After recalling basic notions of combinatorics, representation theory, and some commutative algebra, the main material provides links bet...

Brualdi R.A. Introductory Combinatorics

  • формат pdf
  • размер 9.86 МБ
  • добавлен 29 января 2011 г.
Prentice Hall, 1998. - 614 pages. Introductory Combinatorics emphasizes combinatorial ideas, including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs). Written to be entertaining and readable, this book's lively style reflects the author's jo...

Gessel I., Rota G.-C. (eds.) Classic Papers in Combinatorics

  • формат pdf
  • размер 9.82 МБ
  • добавлен 06 января 2012 г.
Издательство Birkh?user, 2009, -501 pp. This volume surveys the development of combinatorics since 1930 by presenting in chronological order the fundamental results of the subject proved in the orginal papers. We begin with the celebrated theorem of Ramsey [1930], originally developed to settle a special case of the decision problem for the predicate calculus with equality. It remains to this day the fundamental generalization of the classical p...

Graham R.L., Gr?tschel M., Lov?sz L. (eds.) Handbook of Combinatorics. Volume 2

Справочник
  • формат djvu
  • размер 19.61 МБ
  • добавлен 04 октября 2011 г.
Издательство Elsevier, 1995, -1280 pp. Combinatorics belongs to those areas of mathematics having experienced a most impressive growth in recent years. This growth has been fuelled in large part by the increasing importance of computers, the needs of computer science and demands from applications where discrete models play more and more important roles. But also more classical branches of mathematics have come to recognize that combinatorial str...

Heubach S., Mansour T. Combinatorics of Compositions and Words

  • формат pdf
  • размер 7.54 МБ
  • добавлен 27 декабря 2011 г.
Chapman and Hall/CRC, 2009. - 477 pages. A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words. It also presents various tools and approaches that are ap...

Paine S.E. Applied Combinatorics

  • формат pdf
  • размер 861.44 КБ
  • добавлен 06 января 2012 г.
University of Colorado, 2003, -216 pp. The course at CU-Denver for which these notes were assembled, Math 6409 (Applied Combinatorics), deals more or less entirely with enumerative combinatorics. Other courses deal with combinatorial structures such as Latin squares, designs of many types, finite geometries, etc. This course is a one semester course, but as it has been taught different ways in different semesters, the notes have grown to contain...

Ray-Chaudhuri D. Coding Theory and Design Theory. Part I

  • формат pdf
  • размер 10.88 МБ
  • добавлен 15 октября 2011 г.
Издательство Springer, 1990, -252 pp. This book is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on Applied Combinatorics. Coding Theory and Design theory are areas of combinatorics which found rich applications of algebraic structures and are closely interconnected. Coding theory has developed into a rich and beautiful example of abstract sophisticated mathematics being applied successfully to solv...

Stanley R.P. Enumerative Combinatorics. Volume 2

  • формат djvu
  • размер 5.23 МБ
  • добавлен 04 октября 2011 г.
Издательство Cambridge University Press, 1999, -595 pp. This is the second of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. This volume covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the...

Van Lint J.H., Wilson R.M. A Course in Combinatorics

  • формат djvu
  • размер 3.48 МБ
  • добавлен 19 марта 2011 г.
Cambridge University, 1993. - 538 pages. This major textbook, a product of many years' teaching, will appeal to all teachers of combinatorics who appreciate the breadth and depth of the subject. The authors exploit the fact that combinatorics requires comparatively little technical background to provide not only a standard introduction but also a view of some contemporary problems. All of the 36 chapters are in bite-size portions; they cover a g...

Wilf H.S. Generatingfunctionology

  • формат pdf
  • размер 1.54 МБ
  • добавлен 03 июля 2011 г.
A K Peters, 2006. - 245 pages. Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in. * Combinatorics. * Probability Theory. * Statistics. * Theory of Markov Chains. * Number Theory. One of the most important and relevant recent applications of combinatorics lies in th...