• формат pdf
  • размер 3.02 МБ
  • добавлен 14 января 2011 г.
Ashlswede R., Blinovsky V. Lectures on Advances in Combinatorics
Springer, 2008. - 314 pages.

The main focus of these lectures is basis extremal problems and inequalities – two sides of the same coin. Additionally they prepare well for approaches and methods useful and applicable in a broader mathematical context. Highlights of the book include a solution to the famous 4m-conjecture of Erd?s/Ko/Rado 1938, one of the oldest problems in combinatorial extremal theory, an answer to a question of Erd?s (1962) in combinatorial number theory "What is the maximal cardinality of a set of numbers smaller than n with no k+1 of its members pair wise relatively prime? ", and the discovery that the AD-inequality implies more general and sharper number theoretical inequalities than for instance Behrend's inequality.Several concepts and problems in the book arise in response to or by rephrasing questions from information theory, computer science, statistical physics. The interdisciplinary character creates an atmosphere rich of incentives for new discoveries and lends Ars Combinatoria a special status in mathematics.At the end of each chapter, problems are presented in addition to exercises and sometimes conjectures that can open a reader’s eyes to new interconnections.
Смотрите также

Alt H. (Ed.) Computational Discrete Mathematics. Advanced Lectures

  • формат pdf
  • размер 1.07 МБ
  • добавлен 28 сентября 2011 г.
Издательство Springer, 2001, -197 pp. In order to speed up doctoral education in Germany the Deutsche Forschungsgemeinschaft (DFG, German Research Association) in the late 1980s developed a new funding concept for graduate programs called Graduiertenkollegs. Groups of university teachers could join together and submit proposals for doctoral studies within certain areas of research. If funded, the program would supply scholarships for doctoral st...

Berman G., Fryer K.D. Introduction to Combinatorics

  • формат djvu
  • размер 1.99 МБ
  • добавлен 04 октября 2011 г.
Издательство Academic Press, 1972, -310 pp. Combinatorics, or discrete mathematics, and its applications are becoming increasingly important. Polya has said that Combinatorics is an experimental science today just as analysis was decades ago. It is well that students encoun- encounter this branch of mathematics at an early level so that they may appreciate that Combinatorics has become a partner with traditional mathematics and with computer sci...

Berstel J., Lauve A., Reutenauer C., Saliola F. Combinatorics on Words. Christoffel Words and Repetition in Words

  • формат pdf
  • размер 2.63 МБ
  • добавлен 27 декабря 2011 г.
Centre de Recherches Math?matiques, Montr?al, 2008, -202 pp. This book grew out of two series of five two-hour lectures, given by Jean Berstel and Christophe Reutenauer in March 2007. Notes for the lectures were written down by Aaron Lauve and Franco Saliola. They have augmented their notes with several topics and have added more than 100 exercises. There has been a lot of work in adding bibliographic references and a detailed index. The text is...

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

Crnkovi? D., Tonchev V. (eds.) Information Security, Coding Theory and Related Combinatorics. Information Coding and Combinatorics

  • формат pdf
  • размер 6.78 МБ
  • добавлен 15 октября 2011 г.
Издательство IOS Press, 2011, -460 pp. This book contains papers based on lectures presented at the NATO Advanced Study Institute "Information Security and Related Combinatorics", held in the beautiful town of Opatija at the Adriatic Coast of Croatia from May 31 to June 11, 2010. On behalf of all participants, we would like to thank the NATO Science for Peace and Security Programme for providing funds for the conference, as well as the local spo...

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

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