## Combinatorial Matrix Theory

**Author**: Richard A. Brualdi

**Editor:**Cambridge University Press

**ISBN:**9780521322652

**Size**: 12,43 MB

**Format:**PDF, Docs

**Read:**620

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.

## A Combinatorial Approach To Matrix Theory And Its Applications

**Author**: Richard A. Brualdi

**Editor:**CRC Press

**ISBN:**9781420082241

**Size**: 17,65 MB

**Format:**PDF, ePub

**Read:**762

Unlike most elementary books on matrices, A Combinatorial Approach to Matrix Theory and Its Applications employs combinatorial and graph-theoretical tools to develop basic theorems of matrix theory, shedding new light on the subject by exploring the connections of these tools to matrices. After reviewing the basics of graph theory, elementary counting formulas, fields, and vector spaces, the book explains the algebra of matrices and uses the König digraph to carry out simple matrix operations. It then discusses matrix powers, provides a graph-theoretical definition of the determinant using the Coates digraph of a matrix, and presents a graph-theoretical interpretation of matrix inverses. The authors develop the elementary theory of solutions of systems of linear equations and show how to use the Coates digraph to solve a linear system. They also explore the eigenvalues, eigenvectors, and characteristic polynomial of a matrix; examine the important properties of nonnegative matrices that are part of the Perron–Frobenius theory; and study eigenvalue inclusion regions and sign-nonsingular matrices. The final chapter presents applications to electrical engineering, physics, and chemistry. Using combinatorial and graph-theoretical tools, this book enables a solid understanding of the fundamentals of matrix theory and its application to scientific areas.

## Combinatorial Matrix Classes

**Author**: Richard A. Brualdi

**Editor:**Cambridge University Press

**ISBN:**0521865654

**Size**: 14,81 MB

**Format:**PDF, Kindle

**Read:**149

A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Several classes of matrices are thoroughly developed including the classes of matrices of 0's and 1's with a specified number of 1's in each row and column (equivalently, bipartite graphs with a specified degree sequence), symmetric matrices in such classes (equivalently, graphs with a specified degree sequence), tournament matrices with a specified number of 1's in each row (equivalently, tournaments with a specified score sequence), nonnegative matrices with specified row and column sums, and doubly stochastic matrices. Most of this material is presented for the first time in book format and the chapter on doubly stochastic matrices provides the most complete development of the topic to date.

## Nonnegative Matrices And Applications

**Author**: R. B. Bapat

**Editor:**Cambridge University Press

**ISBN:**9780521571678

**Size**: 20,42 MB

**Format:**PDF, ePub

**Read:**748

This book provides an integrated treatment of the theory of nonnegative matrices (matrices with only positive numbers or zero as entries) and some related classes of positive matrices, concentrating on connections with game theory, combinatorics, inequalities, optimisation and mathematical economics. The wide variety of applications, which include price fixing, scheduling and the fair division problem, have been carefully chosen both for their elegant mathematical content and for their accessibility to students with minimal preparation. Many results in matrix theory are also presented. The treatment is rigorous and almost all results are proved completely. These results and applications will be of great interest to researchers in linear programming, statistics and operations research. The minimal prerequisites also make the book accessible to first-year graduate students.

## Combinatorics Automata And Number Theory

**Author**: Valérie Berthé

**Editor:**Cambridge University Press

**ISBN:**0521515971

**Size**: 12,85 MB

**Format:**PDF, Kindle

**Read:**714

This series is devoted to significant topics or themes that have wide application in mathematics or mathematical science and for which a detailed development of the abstract theory is less important than a thorough and concrete exploration of the implications and applications. Books in the Encyclopedia of Mathematics and its Applications cover their subjects comprehensively. Less important results may be summarised as exercises at the ends of chapters, For technicalities, readers can be referred to the bibliography, which is expected to be comprehensive. As a result, volumes are encyclopedic references or manageable guides to major subjects.

## Permanents

**Author**: Henryk Minc

**Editor:**Cambridge University Press

**ISBN:**9780521302265

**Size**: 16,15 MB

**Format:**PDF, ePub

**Read:**277

The purpose of this book, which was first published in 1978, is to give a complete account of the theory of permanents, their history and applications. This volume was the first complete account of the theory of permanents, covering virtually the whole of the subject, a feature that no simple survey of the theory of matrices can even attempt. The work also contains many results stated without formal proofs. This book can be used as a textbook at the advanced undergraduate or graduate level. The only prerequisites are a standard undergraduate course in the theory of matrices and a measure of mathematical maturity.

## The Theory Of Partitions

**Author**: George E. Andrews

**Editor:**Cambridge University Press

**ISBN:**9780521637664

**Size**: 10,50 MB

**Format:**PDF, Docs

**Read:**406

Discusses mathematics related to partitions of numbers into sums of positive integers.

## Matroid Applications

**Author**: Neil White

**Editor:**Cambridge University Press

**ISBN:**9780521381659

**Size**: 14,95 MB

**Format:**PDF, Docs

**Read:**302

This volume, the third in a sequence that began with The Theory of Matroids and Combinatorial Geometries, concentrates on the applications of matroid theory to a variety of topics from engineering (rigidity and scene analysis), combinatorics (graphs, lattices, codes and designs), topology and operations research (the greedy algorithm).

## Eigenspaces Of Graphs

**Author**: Dragoš M. Cvetković

**Editor:**Cambridge University Press

**ISBN:**9780521573528

**Size**: 10,28 MB

**Format:**PDF, ePub, Docs

**Read:**485

This book describes the spectral theory of finite graphs.

## Matrices And Matroids For Systems Analysis

**Author**: Kazuo Murota

**Editor:**Springer Science & Business Media

**ISBN:**3642039944

**Size**: 17,62 MB

**Format:**PDF, ePub, Mobi

**Read:**194

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis. This book serves also as a comprehensive presentation of the theory and application of mixed matrices, developed primarily by the present author in the 1990's. A mixed matrix is a convenient mathematical tool for systems analysis, compatible with the physical observation that "fixed constants" and "system parameters" are to be distinguished in the description of engineering systems. This book will be extremely useful to graduate students and researchers in engineering, mathematics and computer science. From the reviews: "...The book has been prepared very carefully, contains a lot of interesting results and is highly recommended for graduate and postgraduate students." András Recski, Mathematical Reviews Clippings 2000m:93006