Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory

формат pdf
размер 6.18 МБ
добавлен 19 марта 2011 г.

Cambridge University Press, 1991. - 380 pages.

The book deals with the many connections between matrices, graphs, diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorical properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix and Latin squares. The book ends by considering algebraic characterizations of combinatorical properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jorda Canonical Form.

Смотрите также

Berge C. Hypergraphs. Combinatorics of Finite Sets

формат pdf
размер 10.73 МБ
добавлен 04 октября 2011 г.

Издательство North Holland, 1989, -267 pp. For the past forty years, Graph Theory has proved to be an extremely useful tool for solving combinatorial problems, in areas as diverse as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It was thus natural to try and generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets from this standpoint too...

Berge C. Principles of Combinatorics

формат pdf
размер 2 МБ
добавлен 23 июля 2011 г.

Acаdemic Prеss, 1971. - 176 pages. Most mathematicians of this day, confronted with an argument requiring combinatorial thinking, react with one of two stock phrases: (a) This is a purely combinatorial argument, (b) This is a difficult combinatorial argument. Hypnotic repetition of either of these slogans is likely to have the same balming effect on the speaker: freed from all scruples, he will pass the buck and unload the work onto someone else...

Brualdi R.A. Introductory Combinatorics

формат djvu
размер 3.74 МБ
добавлен 22 марта 2011 г.

Prentice Hall, 2004. - 640 pages. This book 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). The volume provides a complete examination of combinatorial ideas and techniques. For individuals interested...

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

Epstein D.B., Cannon J.W., Holt D.F. et al. Word Processing in Groups

формат djvu
размер 2.7 МБ
добавлен 05 сентября 2011 г.

Jones and Bartlett Publishers, 1992. - 352 Pages. This study in combinatorial group theory introduces the concept of automatic groups. It contains a succinct introduction to the theory of regular languages, a discussion of related topics in combinatorial group theory, and the connections between automatic groups and geometry which motivated the development of this new theory. It is of interest to mathematicians and computer scientists, and inclu...

Gyori E., Katona G.O., Lovasz L. (editors) More Sets, Graphs and Numbers: A Salute to Vera Sos and Andras Hajnal

формат pdf
размер 12.65 МБ
добавлен 05 февраля 2011 г.

Springer, 2006. - 405 pages. Bolyai Society Mathematical Studies 15. Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian...

Moon J.W. Counting Labelled Trees

формат djvu
размер 678.04 КБ
добавлен 28 октября 2011 г.

Canadian Mathematical Monographs, 1970, -121 pp. My object has been to gather together various combinatorial results on labelled trees. The basic definitions are given in the first chapter; enumerative results are presented in the next five chapters, classified according to the type of argument involved; some probabilistic problems on random trees are treated in the last chapter. Some familiarity with matrices and generating functions is presupp...

Rosen K.H. (editor-in-chief) Handbook of Discrete and Combinatorial Mathematics

формат pdf
размер 9.32 МБ
добавлен 12 февраля 2011 г.

CRC Press, 2000. - 1183 pages. The Handbook of Discrete and Combinatorial Mathematics is the first book presenting a comprehensive collection of reference material for the essential areas of discrete mathematics as well as for important applications to computer science and engineering. Topics include logic and foundations, counting, number theory, abstract and linear algebra, probability, graph theory, networks and optimization, cryptography and...

Rosen K.H., Michaels J.G. et al. Handbook of Discrete and Combinatorial Mathematics

формат djvu
размер 8.11 МБ
добавлен 31 января 2012 г.

Crc press, 2000. - 1183 pages. The Handbook of Discrete and Combinatorial Mathematics is the first book presenting a comprehensive collection of reference material for the essential areas of discrete mathematics as well as for important applications to computer science and engineering. Topics include logic and foundations, counting, number theory, abstract and linear algebra, probability, graph theory, networks and optimization, cryptography and...

Ryser H.J. Combinatorial Mathematics

формат djvu
размер 1.18 МБ
добавлен 04 октября 2011 г.

Издательство John Wiley, 1963, -162 pp. This monograph requires no prior knowledge of combinatorial mathematics. In Chapter 1 we deal with the elementary properties of sets and define permutation, combination, and binomial coefficient. Of course we treat these concepts from a mature point of view, and from the outset we assume an appreciation for the subtleties of mathematical reasoning. Combinatorial mathematics is best studied within the frame...