LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Maximal rank in matrix spaces via graph matchings

Photo by joelfilip from unsplash

Let Mn(F)Mn(F) be the space of n×nn×n matrices over a field FF. A matrix A=(A(i,j))i,j=1n∈Mn(F) is weakly symmetric if A(i,j)≠0A(i,j)≠0 iff A(j,i)≠0A(j,i)≠0 holds for all i, j  . A matrix… Click to show full abstract

Let Mn(F)Mn(F) be the space of n×nn×n matrices over a field FF. A matrix A=(A(i,j))i,j=1n∈Mn(F) is weakly symmetric if A(i,j)≠0A(i,j)≠0 iff A(j,i)≠0A(j,i)≠0 holds for all i, j  . A matrix is alternating if it is skew-symmetric with zero diagonal. Let Wn(F)Wn(F) and An(F)An(F) denote respectively the set of weakly symmetric matrices and the space of alternating matrices in Mn(F)Mn(F). Let [n]={1,…,n}[n]={1,…,n}. For 0≠A∈Wn(F)0≠A∈Wn(F) let q˜(A)={i,j}, where (i,j)(i,j) is the unique pair in [n]2[n]2 such that A(i,j)≠0A(i,j)≠0 and A(i′,j′)=0A(i′,j′)=0 whenever j

Keywords: space; matrix spaces; maximal rank; rank matrix; rank

Journal Title: Linear Algebra and its Applications
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.