RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. LOMI, 1974 Volume 47, Pages 159–163 (Mi znsl2773)

This article is cited in 1 paper

Short communications

On the algebraic complexity of a pair of bilinear forms

D. Yu. Grigor'ev


Abstract: The problem mentioned in the title is reduced to the evaluation of the range of a set of matrices. The range of matrices $A_1,\dots,A_l$, (denoted by $rg(A_1,\dots,A_l)$,) is the least number of one-dimensional matrices, whose linear combinations represent all $A_i$`s For an operator $A$ in $\mathbb C^n$ there exist a space è and a diagonal operator $B$ with $(A-B)\mathbb C^n\subseteq V$; the minimum of dimensions of such $A_i$`s is denoted by $d(V)$.
Theorem. {\it $rg(E,A)=n+d(A)$, $E$ – denotes the identical matrice.

UDC: 51.01:518.5



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024