• формат djvu
  • размер 1.86 МБ
  • добавлен 18 апреля 2011 г.
Anderson I. Combinatorics of Finite Sets
Dover Publications, 2002. - 272 pages.

Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result conceing k-saturated chain partitions of general partially ordered sets. Connections with Dilworth's theorem, the marriage problem, and probability are also discussed. Each chapter ends with a helpful series of exercises and outline solutions appear at the end.
Смотрите также

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...

Blanchet-Sadri F. Algorithmic Combinatorics on Partial Words

  • формат pdf
  • размер 2.35 МБ
  • добавлен 06 октября 2011 г.
Издательство Chapman & Hall/CRC, 2008, -391 pp. biology, nano-technology, data communication, and DNA computing [104]. Partial words are currently being considered, in particular, for finding good encodings for DNA computations. Courses, covering different sets of topics, are already being taught at some universities. The time seems right for a book that develops, in a clear manner, some of the central ideas and results of this area, as well...

Bollob?s B. Combinatorics. Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics

  • формат djvu
  • размер 1.39 МБ
  • добавлен 06 октября 2011 г.
Издательство Cambridge University Press, 1986, -187 pp. This book is an expanded account of a first-year graduate course in combinatorics, given at Louisiana State University, Baton Rouge during the fall semester of 1985. The traditional ingredients of an initial combinatorics course seem to be combinatorial identities and generating functions, with some introductory design theory or graph theory. Usually, set systems, hyper- graphs and sets o...

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

Справочник
  • формат djvu
  • размер 14.35 МБ
  • добавлен 06 октября 2011 г.
Издательство Elsevier, 1995, -1120 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...

Gyori E., Katona G., Lov?sz L. (eds.) Horizons of Combinatorics

  • формат djvu
  • размер 1.4 МБ
  • добавлен 04 октября 2011 г.
Издательство Springer, 2008, -274 pp. The Janos Bolyai Mathematical Society and the Alfred Renyi Institute of Mathematics organized tIle conference Horizons of Combinatorics during the period July 17-21, 2006 at Ba\01onalmadi (Lake Balaton, Hungary). The Hungarian conferences in combinatorics have the "tradition" not to be organized with regular frequency, and having all different names. Yet, this conference was, in a certain sense, a continuati...

Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

  • формат djvu
  • размер 1.31 МБ
  • добавлен 31 января 2012 г.
Kluwer Academic Publishers, 2002. - 220 pages. Key to Symbols. Set Theory. Sets and Elementary Set Operations. Cartesian Product and Relations. Functions and Operations. Cardinality. Problems. Combinatorics. Four Enumeration Principles. Introductory Problems. Basic Definitions. Generating Functions. Problems. Number Theory. Divisibility of Numbers. Important Functions in Number Theory. Congruences. Diophantine Equations. Problems. Geometry. Prope...

Kung J.P., Rota G.-C., Yan C.H. Combinatorics: The Rota Way

  • формат pdf
  • размер 2.17 МБ
  • добавлен 29 января 2011 г.
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, Sperner theory, commuting equivalence relations and linea...

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...

Ross S.M. Topics in Finite and Discrete Mathematics

  • формат djvu
  • размер 1.33 МБ
  • добавлен 28 октября 2011 г.
Издательство Cambridge University Press, 2000, -272 pp. This text surveys many of the topics taught in discrete and finite mathematics courses. The topics chosen are widely applied in present-day industry and, at the same time, are mathematically elegant. Chapter 1 begins with such preliminaries as sets, mathematical induction, functions, and the division algorithm of algebra. Chapters 2 and 3 present combinatorics and probability. Chapter 4 int...

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...