A combinatorial approach to matrix algebra
نویسنده
چکیده
"The theory of correspondence reaches far deeper than that of mere numerical congruity with which it is associated as the substance with the shadow"
منابع مشابه
BIRS Workshop 11w5033 Linear Algebraic Techniques in Combinatorics & Graph Theory
Linear Algebra and Matrix Theory provide one of the most important tools–sometimes the only tool–in Combinatorics and Graph Theory. Even though the ideas used in applications of linear algebra to combinatorics may be very simple, the results obtained can be very strong and surprising. A famous instance is the GrahamPollak theorem which asserts that if the complete graph of order n is partitione...
متن کاملEfficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
We provide a first demonstration of the idea that matrix-based algorithms for nonlinear combinatorial optimization problems can be efficiently implemented. Such algorithms were mainly conceived by theoretical computer scientists for proving efficiency. We are able to demonstrate the practicality of our approach by developing an implementation on a massively parallel architecture, and exploiting...
متن کاملA Combinatorial Approach to Matrix Algebra
To most contemporary mathematicians matrices and linear transformations are practically interchangeable notions . Indeed, the mainstream 'Bourbakian' establishment, with its profound disdain of the concrete, goes as far as to frown at the mere mention of the word 'matrix'. To me, however, (as well as to a growing number of mathematical dissidents c~lled 'combinatorialists') a matrix has nothing...
متن کاملOn the square root of quadratic matrices
Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.
متن کاملCombinatorial problems in solving linear systems
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. In virtually all cases there should be a notion of sparsity for a combinatorial problem to arise. Sparse matrices therefore form the basis of the interaction of these two seemingly disparate subjects. As the core of many of today’s numerical linear algebra computations consists of the solution of...
متن کاملLegendre Duality in Combinatorial Study of Matrix Pencils
In combinatorial studies of the Kronecker form of matrix pencils, two linear-algebraic characteristics have been featured: degrees of subdeterminants and ranks of expanded matrices. This paper shows the Legendre duality between the two and their combinatorial counterparts for matroid pencils, which serve as upper bounds on the corresponding linear-algebraic quantities. Tightness of one of the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 56 شماره
صفحات -
تاریخ انتشار 1985