2 6 Fe b 20 09 On block partial linearizations of the pfaffian . A . A
نویسنده
چکیده
Amitsur's formula, which expresses det(A + B) as a polynomial in coefficients of the characteristic polynomial of a matrix, is generalized for partial linearizations of the pfaffian of block matrices. As applications, in upcoming papers we determine generators for the SO(n)-invariants of several matrices and relations for the O(n)-invariants of several matrices over a field of arbitrary characteristic.
منابع مشابه
A ug 2 00 6 On block partial linearizations of the pfaffian . A . A
Amitsur's formula, which expresses det(A + B) as a polynomial in coefficients of the characteristic polynomial of a matrix, is generalized for partial linearizations of the pfaffian of block matrices. As an applications, in up-coming papers we determine generators for the SO(n)-invariants of several matrices and relations for the O(n)-invariants of several matrices over a field of arbitrary cha...
متن کاملOn Block Partial Linearizations of the Pfaffian
Amitsur's formula, which expresses det(A + B) as a polynomial in coefficients of the characteristic polynomial of a matrix, is generalized for partial linearizations of the pfaffian of block matrices. As applications, in upcoming papers we determine generators for the SO(n)-invariants of several matrices and relations for the O(n)-invariants of several matrices over a field of arbitrary charact...
متن کاملar X iv : 0 80 4 . 08 64 v 2 [ m at h . N A ] 2 6 Fe b 20 09 Sparse Approximate Solution of Partial Differential Equations ∗
A new concept is introduced for the adaptive finite element discretization of partial differential equations that have a sparsely representable solution. Motivated by recent work on compressed sensing, a recursive mesh refinement procedure is presented that uses linear programming to find a good approximation to the sparse solution on a given refinement level. Then only those parts of the mesh ...
متن کامل. C O ] 2 3 Ju n 20 09 GRAPHICAL CONDENSATION , OVERLAPPING PFAFFIANS AND SUPERPOSITIONS OF MATCHINGS MARKUS
The purpose of this note is to exhibit clearly how the “graphical condensation” identities of Kuo, Yan, Yeh and Zhang follow from classical Pfaffian identities by the Kasteleyn–Percus method for the enumeration of matchings. Knuth termed the relevant identities “overlapping Pfaffian” identities and the key concept of proof “superpositions of matchings”. In our uniform presentation of the materi...
متن کاملLarge Vector Spaces of Block-symmetric Strong Linearizations of Matrix Polynomials
M. I. BUENO∗, F. M. DOPICO †, S. FURTADO ‡, AND M. RYCHNOVSKY § Abstract. Given a matrix polynomial P (λ) = Pk i=0 λ Ai of degree k, where Ai are n × n matrices with entries in a field F, the development of linearizations of P (λ) that preserve whatever structure P (λ) might posses has been a very active area of research in the last decade. Most of the structure-preserving linearizations of P (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009