Results 21 to 30 of about 56 (56)
On the dimension of the algebraic sum of subspaces
We provide a recursive formula for the dimension of the algebraic sum of finitely many subspaces in a finite-dimensional vector space over an arbitrary field.
Makrides Gregoris, Szemberg Tomasz
doaj +1 more source
Possible numbers of x’s in an {x, y}-matrix with a given rank
Let x, y be two distinct real numbers. An {x, y}-matrix is a matrix whose entries are either x or y. We determine the possible numbers of x’s in an {x, y}-matrix with a given rank. Our proof is constructive.
Ma Chao
doaj +1 more source
Bilinear characterizations of companion matrices
Companion matrices of the second type are characterized by properties that involve bilinear maps.
Lin Minghua, Wimmer Harald K.
doaj +1 more source
Minor-closed classes of binary functions [PDF]
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid deletion and ...
Benjamin R. Jones
doaj +1 more source
On relationships between two linear subspaces and two orthogonal projectors
Sum and intersection of linear subspaces in a vector space over a field are fundamental operations in linear algebra. The purpose of this survey paper is to give a comprehensive approach to the sums and intersections of two linear subspaces and their ...
Tian Yongge
doaj +1 more source
Families of graphs with maximum nullity equal to zero forcing number
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symmetric real matrices whose ijth entry is nonzero exactly when fi, jg is an edge in G for i =6 j, and the iith entry is any real number.
Alameda Joseph S. +7 more
doaj +1 more source
Singular matrices possessing the triangle property
It is known that the inverse of an invertible real square matrix satisfying the triangle property is a tridiagonal matrix. In this note, results that may be considered as analogues of this assertion are obtained for the Moore-Penrose inverse and the ...
Priya K. Kranthi, Sivakumar K. C.
doaj +1 more source
On linear codes with random multiplier vectors and the maximum trace dimension property
Let CC be a linear code of length nn and dimension kk over the finite field Fqm{{\mathbb{F}}}_{{q}^{m}}. The trace code Tr(C){\rm{Tr}}\left(C) is a linear code of the same length nn over the subfield Fq{{\mathbb{F}}}_{q}.
Erdélyi Márton +3 more
doaj +1 more source
Variations in the sub-defect of doubly substochastic matrices
The sub-defect of a doubly stochastic matrix AA, denoted as sd(A)=⌈n−sum(A)⌉sd\left(A)=\lceil n-{\rm{sum}}\left(A)\rceil , is defined as the minimum number of rows and columns required to be added to transform the doubly substochastic matrix into a ...
Cao Lei +2 more
doaj +1 more source
Component graphs of vector spaces and zero-divisor graphs of ordered sets
In this paper, nonzero component graphs and nonzero component union graphs of finite-dimensional vector spaces are studied using the zero-divisor graph of a specially constructed 0–1-distributive lattice and the zero-divisor graph of rings.
Nilesh Khandekar +2 more
doaj +1 more source

