All Questions
Tagged with matrices linear-algebra
479 questions with no upvoted or accepted answers
35
votes
0
answers
1k
views
Orthogonal vectors with entries from $\{-1,0,1\}$
Let $\mathbf{1}$ be the all-ones vector, and suppose $\mathbf{1}, \mathbf{v_1}, \mathbf{v_2}, \ldots, \mathbf{v_{n-1}} \in \{-1,0,1\}^n$ are mutually orthogonal non-zero vectors. Does it follow that $...
- 6,351
23
votes
0
answers
8k
views
An $n \times n$ matrix $A$ is similar to its transpose $A^{\top}$: elementary proof?
A famous result in linear algebra is the following.
An $n \times n$ matrix $A$ over a field $\mathbb{F}$ is similar to its transpose $A^T$.
I know one proof using the Smith Normal Form (SNF). ...
- 3,320
21
votes
0
answers
904
views
Cauchy matrices with elementary symmetric polynomials
$\newcommand{\vx}{\mathbf{x}}$
Let $e_k(\vx)$ denote the elementary symmetric polynomial, defined for $k=0,1,\ldots,n$ over a vector $\vx=(x_1,\ldots,x_n)$ by
\begin{equation*}
e_k(\vx) := \sum_{1 \...
- 28.6k
16
votes
0
answers
488
views
An inequality for matrix norms
Working on a problem in combinatorics I come up with the following inequality on matrix norms, which I checked it also numerically:
Let $A=(a_{ij})$ be a real symmetric $n\times n$ matrix with ...
- 4,484
16
votes
0
answers
808
views
Determinant inequality involving Hermitian, positive definite matrices
Let $A,B,C\in M_{n}(\mathbb C)$ be Hermitian and positive-definite matrices such that $A+B+C=I_{n}$.
Show that
$$\det\left(6(A^3+B^3+C^3)+I_{n}\right)\ge 5^n\det(A^2+B^2+C^2)$$
This question has been ...
- 269
15
votes
0
answers
446
views
The rank of a "triangle-free" matrix
This is a version of the question I asked recently, but the assumptions got now strengthened substantially.
Suppose that $A=(a_{ij})_{1\le i,j\le n}$ is a square matrix with all elements in $\{0,\...
- 23k
13
votes
0
answers
237
views
A Dynkin type classification result in linear algebra
Let $G$ be a finite directed acyclic graph. The Cartan matrix $C_G=C$ of $G$ is defined as the matrix with rows and colums indexed by the vertices of $G$ and $c_{i,j}$ counts the number of paths from $...
- 26.5k
13
votes
0
answers
809
views
Can one Gershgorin circle (only) contain all eigenvalues, when the other circles are not contained in it
In short, following a question from my students, I am trying to find a special case where all the eigenvalues of a matrix lie within only one circle, but not in the others, and the other circles are ...
- 673
13
votes
0
answers
1k
views
Pointwise (Hadamard) matrix product and the rank
$\DeclareMathOperator{\rk}{rk}$
Suppose that $A$ is a square matrix of order $n$. If, for any polynomials $P$ and $Q$ with $\deg P+\deg Q\le 2$, we have
$$ P(A)\circ Q(A^t) = P(1)Q(1)\, I_n \tag{$\...
- 23k
13
votes
0
answers
713
views
Regular languages of matrices and their generating functions
My question is somewhat related to this question.
Let us fix natural numbers $k$ and $C$. Let $A$ be an automaton whose alphabet consists of $k\times k$ matrices with integer coefficients of ...
- 3,897
12
votes
0
answers
321
views
Combinatorial proof of invertibility of a symmetric matrix associated to the ring of matrices over a finite field
Let $F$ be a finite field of $q$ elements with characteristic $p$. Let $M_n(F)$ be the ring of $n\times n$ matrices over $F$. We define a $q^{n^2}\times q^{n^2}$ symmetric matrix $L$ over the ...
- 38.6k
12
votes
0
answers
508
views
More mysterious properties of Gram matrix
This is another question related to the mysterious properties of the Gram matrix in dimension $4$. Here's the previous question.
The following fact could be extracted from 0402087:
For any $a_i\...
- 4,316
12
votes
0
answers
218
views
Which ordering of factors is needed to obtain this kind of determinantal inequalities?
Let $A$ and $B$ be $n\times n$ Hermitian positive definite matrices. The curious determinantal inequality given here, which can be stated as $$\det (A^{4}+ ABBA+BAAB+B^{4})\ge\det(A^{4}+ AABB+BBAA+B^{...
- 13.4k
12
votes
0
answers
314
views
Ratio of entries of A and log A where A is a triangular matrix
Consider triangular matrices $A = \left( {a(n,k)} \right)$ of arbitrary order with $a(n,k) = 0$ if $n + k$ is odd and $a(n,n - 2k) = \frac{{n!}}{{k!(n - 2k)!}}\frac{{(m + n - k - 1)!}}{{(m + n - 1)!}}$...
- 5,612
12
votes
0
answers
825
views
Eigenvalues of permutations of a real matrix: how complex can they be?
This is sort of complementary to this thread. I’ll repeat the definitions here:
For a matrix $M\in GL(n,\mathbb R)$, consider the $n!$ matrices obtained by permutations of the rows (say) of $M$ and ...
- 13.4k
11
votes
0
answers
227
views
Matrices that admit a power that is symmetric
We fix an integer $n\geq 2$. Let $S_n$ be the set of real symmetric matrices in $M_n(\mathbb{R})$. We consider the algebraic sets $Y_k=\{A\in M_n(\mathbb{R});A^k\in S_n\},k\geq 2$ and the sequence $...
- 3,741
11
votes
0
answers
764
views
Fast computation of matrix product $AXA^T$ with fixed $A$?
Suppose we have two $n$-by-$n$ matrices $X$ and $A$, where $A$ is known and $X$ may change in different invocations, and we want to compute $AXA^T$. Is there an algorithm that beats the naive one of ...
- 75
11
votes
0
answers
313
views
Jaffard's theorem - finite matrices
For infinite matrices, Jaffard's theorem states that if $(A(k,l))_{k,l\in \mathbb{Z}}$ is invertible and satisfies
$$
A(k,l) \leq C (1+\left|k-l\right|)^{-r},
$$
for some $C>0$,
then
$$
A^{-1}(k,...
- 393
11
votes
0
answers
305
views
Generalized Classical Adjoints and Factorizations of the Characteristic Polynomial
This is idle noodling, and I'm prepared to learn that it's foolish as well as idle. But....
Let $M$ be an $n\times n$ matrix over, oh, let's say an algebraically closed field for now. There have ...
- 23k
10
votes
0
answers
237
views
Generalized eigen property of a matrix
Given a $n \times n$ invertible matrix $A$, I am interested in the set
$$
\mathcal{S}(A) = \{ D \textrm{ diagonal matrix } \mid \det(D - A) = 0 \}.
$$
Thus, for all eigenvalues $\lambda_i$, we have $...
- 909
10
votes
0
answers
276
views
A $k \times n$ matrix with a lot of invertible $k \times k$ submatrices over $\mathbb{F}_2$
In the appendix of the paper by Tolhuizen (
http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=841182) there is a very fast and easy probabilistic proof that for $k=cn$ where $c \in [0,1]$ is fixed, ...
- 3,004
10
votes
0
answers
477
views
Name for an operation on matrices?
Given two matrices $A$ and $B$ of size $a \times n$ and $b \times m$ consider the following operation $A \dagger B$ whose result is an $a b^n \times n m$ matrix. $A \dagger B$ is a block matrix with $...
9
votes
0
answers
270
views
The number of non-singular $n\times n$ matrices over $\mathbb{F}_2$ with exactly $k$ non-zero entries
Suppose $M_{n}^{k}$ is the number of non-singular $n\times n$ matrices over $\mathbb{F}_2$, that have exactly $k$ non-zero entries.
Is there some sort of formula to calculate $M_n^k$?
If $k < n$ ...
- 2,618
9
votes
0
answers
624
views
Eigenvalues of leading principal submatrix of the Clement-Kac-Sylvester tridiagonal matrix
It's well-known that the eigenvalues of the Clement-Kac-Sylvester tridiagonal matrix
$$\begin{pmatrix}
0 & n-1 & 0 & \dots & 0 \\\
1 & 0 & n-2 & \dots & 0\\\
0 & ...
- 139
9
votes
0
answers
360
views
Finding $U,V$ in Thompson's Formula
Thompson's formula says, given $A,B \in \mathfrak{su}(n)$, there exists $U,V \in SU(n)$ such that:
$e^{A}e^{B}=e^{UAU^{\dagger} + VBV^{\dagger}}$
Given $a,b \in \mathfrak{su}(4)$ defined by:
$a=J_x ...
- 2,099
9
votes
0
answers
978
views
Strong convexity of the trace of the square root of a matrix function
Any clues about how to prove that the following function is strongly-concave in $x$? (We conjecture it is $2$-strongly concave but cannot prove it. We have already proved strict concavity through ...
- 91
8
votes
0
answers
335
views
How to check two matrices for similitude over $\mathbb{Z}$?
General question. Let $A$ and $B$ be two $n\times n$-matrices over
$\mathbb{Z}$. How do I algorithmically check whether $A$ and $B$ are similar
(i.e., conjugate in the ring $\mathbb{Z}^{n\times n}$)?
...
- 33.8k
8
votes
0
answers
285
views
Matrix decompositions as monoid isomorphisms. Ever considered before?
I've noticed some correspondences between some matrix decompositions and monoid isomorphisms (always to some free commutative monoid), in addition to the one I asked about in a previous question:
...
- 4,943
8
votes
0
answers
576
views
A rank inequality
Suppose
$$M := \begin{bmatrix}
M_{11} & \cdots &M_{1d} \\
\vdots & \ddots & \vdots \\
M_{d1} & \cdots & M_{dd}
\end{bmatrix}$$
is a $d \times d$ block matrix such that
$$M_{...
- 500
8
votes
0
answers
491
views
Strange determinant inequality $\det(C+ xA) \det(C-xA) \le (\det C)^2$
Let $A$ be an all-one $3$-by-$3$ matrix, let $C$ be a $3$-by-$3$ matrix, and let $x$ be a real number. How might one prove the following inequality?
$$\det(C+ xA) \det(C-xA) \le (\det C)^2$$
- 99
8
votes
0
answers
738
views
Bounding sum of first singular values squared for Kronecker sum of traceless matrices
Let $A$ and $B$ be $4\times4$ traceless matrices with Hilbert-Schmidt norms summing up to $1/4$, i.e.
$$\text{Tr}\left[ A\right]=\text{Tr}\left[ B\right] = 0,\qquad\text{Tr}\left[ A^\dagger A + B^\...
- 1,612
8
votes
0
answers
694
views
Path connected set of matrices?
Consider the collection of $n$ by $n$ matrices
$$S=\{ A: A_{ij}\le0,\quad (-1)^{c_i}\det A(P_i;Q_i)<0 \quad \text{for} \quad i=1,\ldots, k\}$$
where $c_i\in \{0,1\}$, $P_i$ and $Q_i$ are disjoint ...
- 1,533
8
votes
0
answers
221
views
Standard polynomials applied to matrices (bis)
The standard polynomial in $r$ non-commuting indeterminates $x_1,\ldots,x_r$ is defined by
$${\mathcal S}_r(x_1,\ldots,x_r):=\sum_{\sigma\in S_r}\epsilon(\sigma)x_{\sigma(1)}x_{\sigma(2)}\cdots x_{\...
- 52.3k
7
votes
1
answer
238
views
Hadamard product decomposition with lower rank matrices
Given integers $k$ and $l$ and a matrix $A$ of rank $kl$, can we always find a matrix $B$ of rank $k$ and a matrix $C$ of rank $l$, such that $A$ is the Hadamard product of $B$ and $C$, namely $A=B \...
- 71
7
votes
0
answers
195
views
Hölder continuity of spectrum of matrices
Endow $\mathbb{C}^{d \times d}$ with the norm induced by the Euclidean norm on $\mathbb{C}^d$. It is well-known (to those who know it well, I guess) that the spectrum $\sigma(A)$ of a matrix $A \in \...
- 12.5k
7
votes
0
answers
107
views
Potential p-norm on tuples of positive operators
This is a follow-up to this question on p-norms of tuples of operators.
Consider $\left[\begin{matrix} A \\ B \end{matrix}\right] \in B(H)^2_+$, meaning $A,B\geq 0$, and define
$$
\left\|\left[\begin{...
- 3,984
7
votes
0
answers
905
views
The Möbius function as eigenvalues
Let the $N$ by $N$ matrix $A$ be defined by the tetration:
$$\Large \text{If } \gcd(n, k)=1 \text{ then } A(n,k)= \underbrace{e^{e^{\cdot^{\cdot^{e^{\Re\left(\frac{1}{n^s}\right)}}}}}}_m \text{ else }...
- 1,183
7
votes
0
answers
177
views
Matrix of high rank mod $2$: must it have a large non-singular minor (with disjoint rows and columns)?
Let $A$ be a $2n$-by-$2n$ matrix with entries in
$\mathbb{Z}/2\mathbb{Z}$ such that, for every $2n$-by-$2n$ diagonal
matrix $D$ with entries in $\mathbb{Z}/2\mathbb{Z}$, the matrix $A+D$
has rank $\...
- 20.2k
7
votes
0
answers
264
views
Bound on gap between least eigenvalues of $n \times n$ correlation matrix and of its $(n -1) \times (n-1)$ submatrices
The following problem is motivated by one of my research problems.
Let
$\Sigma$ be an $n \times n$ correlation matrix whose least eigenvalue is denoted by $\lambda$.
$\Sigma_i'$ be an ...
- 141
7
votes
0
answers
296
views
Counting 0-1 $n\times n$ matrices with a given rank r
What is the number $N$ of $n \times n$ $0$-$1$ matrices with rank $k$?
I read this sequence is
"OEIS A064230 Triangle $T(n,k)$ = number of rational (0,1) matrices of rank $k$ ($n\ge 0$, $0\le k\le ...
- 1,677
7
votes
0
answers
335
views
Does this inequality always hold?
Denote the adjacency matrix of a given undirected graph by $g$. It is an $n$-by-$n$ symmetric Boolean matrix with elements on the diagonal to be zero ($n\geq 3$). Let $g_{12}=g_{21}=g_{13}=g_{31}=1$ ...
- 79
7
votes
0
answers
217
views
Characterizing matrices with rank constraint
Given matrix $M\in\Bbb\{0,1\}^{n\times n}$, is there a nice method to characterize $$\mathscr{D}[M]=\{Q\in\Bbb\{0,1\}^{n\times n}:\mathsf{rank}(M-Q)= \mathsf{rank}(Q),\quad M-Q\in\Bbb\{0,1\}^{n\times ...
- 13.9k
7
votes
0
answers
384
views
Concept of eigenvector restricted to nonnegative entries
Let $X\in \mathbb{R}^{n\times n}$ be a positive semidefinite matrix. The leading eigenvector $v\in \mathbb{R}^n$ of $X$ is the solution to the problem
$\arg \max_{v:\lVert v\rVert_2=1} \lambda\quad$ ...
- 373
7
votes
0
answers
294
views
Largest entry of the inverse matrix?
I wonder if there is a "qualitative way" of predicting from the structure ix of the matrix $A$ which entry of $A^{-1}$ will be the largest. I am specially interested in the case
that $A$ is a ...
- 6,962
6
votes
0
answers
130
views
Bent vectors and $\pm 1$ eigenvectors with respect to non-Sylvester Hadamard matrices
A Hadamard matrix is an $n\times n$-matrix $H$ where each entry in $H$ is $\pm 1$ and where $H/\sqrt{n}$ is orthogonal. It is well-known that if $H$ is an $n\times n$-Hadamard matrix, then $n<3$ or ...
6
votes
0
answers
111
views
Factorization to sparse matrices
$\newcommand{\lrank}{\operatorname{lrank}}$
$\newcommand{\rank}{\operatorname{rank}}$
Given a matrix $A$, we can define its Hamming weight, $w(A)$, as the number of non-zero elements in it.
Now, given ...
- 3,319
6
votes
0
answers
188
views
Expressing an invertible sparse matrix as a product of few elementary matrices
Let $M$ be an $n \times n$ matrix with integer entries. Suppose that $M$ is invertible (over the integers) and that $M$ has at most $An$ nonzero entries, each of which is less than $B$ in absolute ...
- 18.7k
6
votes
0
answers
340
views
Asymptotically nilpotent Lie sets of matrices
A matrix $A\in\textbf{Mat}_n(\mathbb{R})$ is called asymptotically nilpotent if for each vector $v$, ${\lim}_{k\to\infty}A^k(v) = 0$.
Question 1. Assume that $\mathcal{A}$ is the subset of $\textbf{...
- 291
6
votes
0
answers
392
views
Divisibility properties of minors of matrices
Let $A$ be an $m\times n$ matrix with integer entries. Let $d_i(A)$ be the greatest common divisor of all $i\times i$ minors of $A$, and define $d_0(A)=1$. Whenever $i\leq j$, one has that $d_i(A)$ ...
- 191
6
votes
0
answers
141
views
Algorithm to check a conjectural value for the rank of a large matrix
Feel free to suggest a different title, I'm not sure how to phrase this. I'm in the following somewhat specific situation:
I'm checking a conjecture which at the end of the day boils down to the ...
- 8,524