All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $9.86Trending at AU $16.84
- AU $11.51Trending at AU $18.82
- AU $24.83Trending at AU $25.31
- AU $64.07Trending at AU $74.95
- AU $28.70Trending at AU $37.00
- AU $24.97Trending at AU $28.26
- AU $9.83Trending at AU $13.32
About this product
- DescriptionIn a sign-solvable linear system, the signs of the coefficients determine the signs of some entries in the solution. This type of system is part of a larger study that helps researchers understand if properties of a matrix can be determined from combinatorial arrangements of its elements. In this book, the authors present the diffuse body of literature on sign-solvability as a coherent whole for the first time, giving many new results and proofs and establishing many new connections. Brualdi and Shader describe and comment on algorithms implicit in many of the proofs and their complexity. The book is self-contained, assuming familiarity only with elementary linear algebra and graph theory. Intended primarily for researchers in combinatorics and linear algebra, it should also be of interest to computer scientists, ecomists, physicists, chemists, and engineers.
- Author(s)Bryan L. Shader,Richard A. Brualdi
- PublisherCambridge University Press
- Date of Publication29/09/1995
- Series TitleCambridge Tracts in Mathematics
- Series Part/Volume NumberNo.116
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content Note7 b/w illus.
- Weight640 g
- Width152 mm
- Height228 mm
- Spine22 mm
- Series Edited byB. Bollobas,W. Fulton,A. Katok,F. Kirwan,P. Sarnak,B. Simon
This item doesn't belong on this page.
Thanks, we'll look into this.