Results 51 to 60 of about 641 (72)

On relationships between two linear subspaces and two orthogonal projectors

open access: yesSpecial Matrices, 2019
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

On the dimension of the algebraic sum of subspaces

open access: yesOpen Mathematics
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

Families of graphs with maximum nullity equal to zero forcing number

open access: yesSpecial Matrices, 2018
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

open access: yesSpecial Matrices
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

open access: yesJournal of Mathematical Cryptology
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

A globally convergent flow for computing the best low rank approximation of a matrix

open access: yes, 2007
We work in the space of $m$-by-$n$ real matrices with the Frobenius inner product. Consider the following Problem: Given an m-by-n real matrix A and a positive integer k, find the m-by-n matrix with rank k that is closest to A.
Driessel, Kenneth R.
core   +2 more sources

Variations in the sub-defect of doubly substochastic matrices

open access: yesSpecial 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

open access: yesAKCE International Journal of Graphs and Combinatorics
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

Sequencing Analysis and Identification of the Primary Peptide Component of the Dialyzable Leukocyte Extract "Transferon Oral": The Starting Point to Understand Its Mechanism of Action. [PDF]

open access: yesFront Pharmacol, 2020
Vallejo-Castillo L   +10 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy