Combinatorial Matrix Theory
Series: Encyclopedia of Mathematics and its Applications; 39;
- Publisher's listprice GBP 134.00
-
67 817 Ft (64 588 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 13 563 Ft off)
- Discounted price 54 254 Ft (51 670 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
67 817 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 26 July 1991
- ISBN 9780521322652
- Binding Hardback
- No. of pages380 pages
- Size 236x160x32 mm
- Weight 760 g
- Language English 0
Categories
Short description:
This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory.
MoreLong description:
This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. This subject concerns itself with the use of matrix theory and linear algebra in proving results in combinatorics (and vice versa), and with the intrinsic properties of matrices viewed as arrays of numbers rather than algebraic objects in themselves. There are chapters dealing with the many connections between matrices, graphs, digraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorial properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix, and Latin squares. The final chapter deals with algebraic characterizations of combinatorial properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jordan Canonical Form. The book is sufficiently self-contained for use as a graduate course text, but complete enough for a standard reference work on the basic theory. Thus it will be an essential purchase for combinatorialists, matrix theorists, and those numerical analysts working in numerical linear algebra.
"A reader who is familiar with basic results in matrix theory will surely be captivated by this concise self-contained introduction to graph theory and combinatorial ideas and reasoning." S. K. Tharthare, Mathematical Reviews
Table of Contents:
1. Incidence matrices; 2. Matrices and graphs; 3. Matrices and digraphs; 4. Matrices and bigraphs; 5. Combinatorial matrix algebra; 6. Existence theorems for combinatorially constrained matrices; 7. Some special graphs; 8. The permanent; 9. Latin squares.
More
