Questions about the properties of vector spaces and linear transformations, including linear systems in general.

learn more… | top users | synonyms

1
vote
0answers
12 views

Can we give efficiently the solution of a bilinear system of equations over a finite field?

Consider a finite field $F$ and suppose we have a system of equations $$h_1(\alpha,\beta)=0,h_2(\alpha,\beta)=0,...,h_t(\alpha,\beta)=0$$ where $\alpha=(\alpha_1,...,\alpha_s)$ and ...
1
vote
1answer
170 views

Why are 1 and -1 eigenvalues of this matrix?

This is a subject I've been working on for a very long time now, but still did not manage to fully understand the interesting properties of this matrix $\mathbf{A}$. First, let's define two matrices: ...
3
votes
0answers
22 views

Probe permutationally matrix extreme properties

Suppose given $M\in\{0,1\}^{n\times n}$ of rank $r$. Assume that changing even a single $1$ to $0$ in $M$ raises rank. Does it follow that $M$ is permutationally equivalent to a block diagonal ...
1
vote
0answers
67 views

alternative way to recognize that a real symmetric quadratic form is positive

A real symmetric quadratic form $g(x)=\varSigma_{1\leq i,j \leq n}\,g_{ij} x^i x^j$ is positive (definite) if $g(x)>0$ for every $\mathbb{R}^n\ni x=(x^1,...,x^n)\neq 0$. It is well known that a ...
1
vote
0answers
27 views

How to define the determinant of a morphism between graded Lie algebras?

I have the following question. Suppose $g_1$ and $g_2$ are two finite dimensional, nilpotent, stratified Lie algebras and $A:g_1\to g_2$ is a morphism of the graded Lie algebra. I wonder whether there ...
-1
votes
0answers
51 views

Minimum rank non-negative matrix summations

Given matrix $M\in\Bbb Z_{\geq0,\leq b}^{n\times n}$ of rank $r$. What is minimum $k$ such that $$\mathscr{A}[b,k]=\{Q\in\Bbb R_{\geq0,\leq b}^{n\times n}:\mathsf{rank}(Q)\leq k\}$$ contains $R,S$ ...
0
votes
0answers
51 views

A combinatorial question on ranks

Denote $$\mathscr{C}[r]=\{Q\in\Bbb Z_{\geq 0,\leq 1}^{n\times n}:\mathsf{rk}(Q)= r\}.$$ $$\mathscr{D}[A,t]=\{B\in\mathscr{C}[\mathsf{rk}(A)]:\mathsf{dim}(col(A)\cap col(B))\geq t\}.$$ Given ...
5
votes
0answers
134 views

Characterizing matrices with rank constraint

Given matrix $M\in\Bbb Z_{\geq0,\leq b}^{n\times n}$, is there a nice method to characterize $$\mathscr{D}[M,b]=\{Q\in\Bbb R_{\geq0,\leq b}^{n\times n}:\mathsf{rank}(M-Q)= \mathsf{rank}(Q),\quad ...
1
vote
0answers
38 views

Probability of non-negative matrix relaxation

Given matrix $M\in\Bbb\{0,1\}^{n\times n}$, take $\mathscr{M}[M]=\{Q\in R_{\geq0}^{n\times n}:Q[ij]>0\iff M[ij]=1\}$. Does ...
-1
votes
0answers
37 views

Orthogonal vector to arbitrary vector in R3 [on hold]

I got a vector $(0, 0, 0)^T \neq v \in R^3$. Now I want a closed formula for some orthogonal vector to $w$ (I don't care which). My problem is that if I, for instance, fix $w_1$ and $w_2$ then $w_3 = ...
2
votes
1answer
50 views

Maximizing Frobenius Norm of Commutator (an opposite Procrustes problem)

I was wondering if anybody has any suggestions on the following problem: Let $S$ be an $n\times n$ positive definite symmetric matrix. I wish to find an $n\times n$ orthogonal matrix $R$ which ...
6
votes
0answers
225 views

A matrix trace inequality

The well-known Powers-Stormer inequality says the following: for positive semidefinite operators $A, B$, we have that $\mathrm{Tr}((A - B)(A - B)^\dagger) \leq \| A^2 - B^2 \|_1$, where $\| \cdot ...
0
votes
1answer
263 views

Find the following transformation $G$

I asked this question 6 days ago on math.stackexchange.com (http://math.stackexchange.com/questions/656585/find-the-following-transformation-g). I didn't get any answers yet, so I'm posting here. I'm ...
3
votes
1answer
77 views

Upper bounds on elements of a matrix

During my research I have come across matrices this type $$C=B\left(B^T B\right)^{-1}B^T\ ,$$ where $B$ is an $m\times n$ real matrix. If $B^TB$ is not invertible, then $\left(B^T B\right)^{-1}$ ...
-1
votes
0answers
25 views

Linear combinations of columns of matrices [on hold]

Suppose E is a 4 × 3 matrix with columns ⃗c1, ⃗c2, ⃗c3 and rows ⃗r1, ⃗r2, ⃗r3, ⃗r4. Let ⃗v be a 3 x 1 matrix that = [2, -1, 1] How could we express E⃗v as a linear combination of ⃗c1, ⃗c2, ⃗c3? Now ...
0
votes
0answers
95 views

Anticommuting operators with positive properties

Which classes of $M\in \mathsf M_k(\Bbb R)^{n\times n}$ admit solutions $N\in \mathsf M_k(\Bbb R)^{n\times n}$ such that $$(M\otimes N+N\otimes M)(u\otimes u)=0$$ forall $u\in \mathsf D_k(\Bbb ...
3
votes
0answers
25 views

Quasi-M matrices?

Does any body know a reference on lower triangular matrices with negative entries everywhere except for the diagonal and subdiagonal where entries are positive (when all entries are negative with ...
8
votes
3answers
267 views

Distinguishing combinatorial maps by their linearizations

Every (not-necessarily invertible) map $f$ from $[n]:=\{1,2,,,,.n\}$ to itself determines a linear map $L_f$ from ${\bf R}^n$ to itself that sends the basis vector $e_k$ to $e_{f(k)}$ for $1 \leq k ...
4
votes
1answer
134 views

Matrix-convexity of inverse of the cofactor matrix

Consider the matrix-valued function $f(A) = \frac{A}{\det(A)}$ on the set of $3\times 3$ positive-definite matrices. Is this function matrix-convex ? (i.e., is $tf(A) + (1-t)f(B) - f(tA+(1-t)B)$ ...
9
votes
1answer
193 views

Perron-Frobenius theory for reducible matrices

Can someone suggest some sources/references dealing with the Perron-Frobenius theory for nonnegative matrices that are reducible? Specifically, if $A\ge 0$ is a $d\times d$ matrix with no assumptions ...
-3
votes
0answers
30 views

Finding the value that will lead to population stabilization [closed]

What value of r subscript 2, will lead to the population stabilizing? A is a 4x4 matrix containing reproduction rate, survival rate and maturity rate. B is a 4x1 matrix containing the populations for ...
1
vote
0answers
45 views

Zero as a repeated permanental root for a matrix over a finite field

All, Suppose $A \in Mat(n, \mathbb{F}_{q})$ for $q$ prime, $q \geq 5$, and $n \geq 2^{q-2}$ . Let $\pi_A(x)$ be the permanental polynomial for $A$. That is, \begin{equation*} \pi_{A}(x)=per(xI-A). ...
0
votes
0answers
63 views

Primitive matrix type rank range [closed]

Given a non-negative matrix $A$, we call $A$ primitive if $A^k$ has all strictly positive entries with some $k>0$. Following matrix $$\begin{pmatrix} a& b\\ c& 0 \end{pmatrix}$$ with ...
3
votes
1answer
94 views

A norm description for singular matrices

For $n>2$, are there norms $\parallel.\parallel_{a}$ and $\parallel.\parallel_{b}$ on $M_{n}(\mathbb{R})$ with the following property: $A\in M_{n}(\mathbb{R})$ is singular if and only if ...
4
votes
1answer
62 views

On primitive type matrix ranks

Given a non-negative matrix $A$, we call $A$ primitive if $A^k$ has all strictly positive entries with some $k>0$. Given primitive $A$, is there relation between smallest $k$ such that $A^k>0$ ...
127
votes
19answers
17k views

Geometric Interpretation of Trace

This afternoon I was speaking with some graduate students in the department and we came to the following quandry; Is there a geometric interpretation of the trace of a matrix? This question ...
0
votes
0answers
12 views

Dense Symmetric Rank Deficient Linear System

What are some of the best methods for solving a Dense Rank Deficient Linear System Ax = b, where A is Dense, Symmetric but possibly Rank Deficient. I know SVD can solve it pretty nicely while ...
2
votes
1answer
262 views

Diagonalization of 4th order tensors

I have been wondering about the following problem... Let $n$ be a positive integer and denote by $M_n^s$ the space of symmetric $n\times n$ real matrices. Now, we look at the space $\mathcal ...
11
votes
2answers
588 views

Hölder's inequality for matrices

I was wondering if the Hölder's inequality was true for matrix induced norms, i.e. if $$\|AB\|_1 \leq \|A\|_p\|B\|_q, \quad\forall p,q \in [1,\infty] \text{ s.t. } \tfrac{1}{p}+\tfrac{1}{q} = 1.$$ But ...
3
votes
2answers
111 views

Positive definiteness of infinite tridiagonal matrices

I am interested in the following problem: I have an infinite symmetric tridiagonal matrix $$ A= \begin{bmatrix} a_1 & b_1 & & & \\ b_1 & a_2 & b_2 & & ...
0
votes
1answer
49 views

Stationary distribution of random walk alias solving uncountably many linear equations [closed]

Let us have interval $I = (i_1,i_2)$, function $f_1 : I \mapsto I$, function $f_2 : I \mapsto I$. Let $x_0$, $x_1$, $x_2$, ... be series of random variables from interval $I$ denoting random walk. ...
0
votes
1answer
138 views

A geometric property of singular matrices

Let $S\subset M_{n}(\mathbb{R})$ be the singular points of the equation $Det=0$. That is $S$ is the critical points of the determinant function. What matrices belongs to $S$, precisely? Let ...
0
votes
0answers
52 views

Specific optimization problem solution procedures

Is there a standard procedure to solve following two optimization problems? $$\mathsf{Problem\mbox{ }I}:\mbox{ }\min_{A\in\{0,1\}^{n\times n}:rk(A)=r}\mbox{ }\max_{R,S\in\Bbb R^{n\times ...
0
votes
0answers
88 views

Classifying 1 cycle permutation matrices

Given a permutation matrix that is not full rank, is there a linear algebraic and corresponding algebraic criterion to tell if matrix contains more than one disjoint non-trivial cycle or exactly one ...
1
vote
1answer
35 views

Phase of the inner product between the elements of an ETF

I am doing research in compressive sampling for Cognitive Radio applications. While working on a project I came across with the following question: Is there any research about the phase of inner ...
6
votes
1answer
164 views

Speed up Linear programming

I have a linear programming problem like this: minimize $c^t X$ under the constraint that $AX \ge b$. I will need to solve this linear programming problem online many times. I need it to be as fast ...
1
vote
0answers
90 views

Reference: Continuity of Eigenvectors [closed]

I am looking for an appropriate reference for the following fact. I already posted on math.stackexchange, but got no answer. For each $X \in \mathbb{R}^{n \times n}_{\text{sym}}$ (symmetric ...
1
vote
0answers
98 views

Matrices with a common Fischer basis

Let $A$ be a real symmetric $n\times n$ matrix, normalized such that $Tr[A]=1$. Define a 'Fischer basis' as the basis in which all diagonal elements are equal to $\frac{1}{n}$. The motivation for ...
1
vote
0answers
30 views

Bound of spectral radius of polynomial of a complex matrix

I am trying to prove or disprove the following inequality. $$ ||P(A)||_2\leq 2 \max_{\alpha\in W(A)}| P(\alpha)|,$$ where $P(\cdot)$ is a complex polynomial, $A\in \mathbb{C}^{n\times n}$ and ...
6
votes
2answers
660 views

Cauchy-Schwarz inequality for bilinear forms valued in an abstract vector space

I previously posted this question on Math.SE but didn't receive an answer. It is perhaps a little vague; part of what I want to know is what question I should ask. First, consider the following form ...
0
votes
0answers
67 views

Integration over a second order tensor [migrated]

I would like to compute the mean value of a second order tensor $\mathbf{T}$ expressed in planar cylindrical coordinates. The mean value for any second order tensor is (reference [1] page 101) ...
0
votes
1answer
38 views

Characterisation of a matrix ordering property

Let $n$ be a positive integer; we consider all matrices mentioned henceforth to be $n$-by-$n$ matrices. Let $A$ and $B$ be matrices wherein all entries are nonnegative (such matrices will be called ...
2
votes
2answers
146 views

Matrices with real spectrum

Assume you have a non-symmetric real square matrix of all whose eigenvalues are real. Can anything be said about it? Is it unitarily equivalent to a symmetric matrix? EDIT: Is it at least similar to ...
1
vote
0answers
94 views

Eigenvalue of product of self adjoint compact operators

Suppose A is a self adjoint $m \times m$ real matrix with eigenpairs $\{e_j, \lambda_j\}$ such that $\lambda_j > \lambda_{j + 1}$. Let $B$ be another self adjoint real $m \times m$ matrix such that ...
3
votes
3answers
310 views

Are the finite dimensional von Neumann algebras, singly generated?

Let $\mathcal{M}$ be a finite dimensional von Neumann algebra, then : $$\mathcal{M} \simeq \bigoplus_i M_{n_i}(\mathbb{C})$$ Question : Is it singly generated (as von Neumann algebra)? how ? ...
1
vote
1answer
95 views

Matrix Submodular Inequality

Given $a,b,x > 0$ I know following the submodularity property holds: \begin{align} \frac{1}{a} - \frac{1}{a+x} \geq \frac{1}{a+b} - \frac{1}{a+b+x} \end{align} My question is, does this property ...
0
votes
1answer
146 views

Bounded domain matrix factorization

Assume we're trying to find $A\in [-1,1]^{n\times d}, B\in [-1,1]^{m\times d}$, from an observed matrix $C\in [-d,d]^{n\times m}$, where $C=AB^T$. The goal is to return $\widehat A, \widehat B$ such ...
1
vote
1answer
314 views

Rational subspaces

In $\mathbb{R}^n$, we say that a linear subspace is rational if it admits a basis in $\mathbb{Q}^n$ (or equivalently in $\mathbb{Z}^n$). This means that $E\cap \mathbb{Z}^n$ is a submodule of ...
0
votes
2answers
90 views

About adding a negative definite rank-1 matrix to a symmetric matrix

If $B$ is a symmetric matrix then how do its eigenvalues compare to the eigenvalues of $B - vv^T$? ( where $v$ is a vector of the same dimension as $B$) I guess that the eigenvalues of $B - vv^T$ ...
4
votes
2answers
197 views

Convexity of a function of matrices

Let $A$ be an $n\times n$ positive-definite matrix. Let $0<\lambda _1 \leq \lambda_2 \leq \lambda _3 \ldots \leq \lambda _n$ be the eigenvalues of $A$. Let $n\geq k\geq 1$. Is the function $f(A) = ...