Questions tagged [matrices]
Questions where the notion matrix has an important or crucial role (for the latter, note the tag matrix-theory for potential use). Matrices appear in various parts of mathematics, and this tag is typically combined with other tags to make the general subject clear, such as an appropriate top-level tag ra.rings-and-algebras, co.combinatorics, etc. and other tags that might be applicable. There are also several more specialized tags concerning matrices.
3,119
questions
1
vote
1
answer
99
views
Multiplicatively closed subsets of $\mathbb{C}^{n \times n}$
While dealing with another problem I saw that I need to classify subspaces $V$ of $\mathbb{C}^{n \times n}$ that are multiplicatively closed.
So to get an idea of the nature of the subspaces I ...
- 11
0
votes
1
answer
285
views
Standard rational functions from matrices
In linear algebra we get introduced to standard polynomials that are associated to matrices such as characteristic polynomials and determinants.
What are some of the standard rational functions that ...
- 13.7k
1
vote
1
answer
170
views
Number of turning points on a nondecreasing $n^2 \times n^2$ matrix
Given a integer value $n$, we generate a $n^2 \times n^2$ integer matrix $M$ in the following way.
Each ceil has value range $[1~n]$
In each row, the value is nondecreasing. E.g. $M[i, j] \leq M[i, ...
- 169
2
votes
0
answers
261
views
Decomposing a matrix into the tensor product of a permutation and orthogonal matrix
Suppose I have a square matrix $A \in \mathbb{R}^{mn \times mn}$. I want to find
$$\arg \min_{P, Q} \|A - P \otimes Q\|_F$$
where $P$ is an $m \times m$ permutation matrix and $Q$ is an $n \times n$...
- 121
7
votes
2
answers
433
views
Covering the zeros of 0/1 matrix with submatrices
The matrices I am dealing with are $n\times n$ of the following type (with $n=7$):
$M_7=\begin{pmatrix}1&0&0&0&0&0&1 \\ 1&1&0&0&0&0&0 \\ 0&1&1&...
- 115
3
votes
1
answer
261
views
On a determinantal equality
In my study, I come across the following curious equality, which I do not know a proof yet (so I am asking it here).
Let $k$, $l\in \Bbb Z$ be fixed, $m$ --- the size of the below matrix $M$ --- is ...
- 305
1
vote
0
answers
114
views
A question on Perron–Frobenius theorem [closed]
Let $A \in M_n$ is nonnegative(all $a_{ij}\ge0$).
Suppose $A$ has a nonnegative eigenvector(all entries$\ge0$ ) with $r ≥ 1$ positive entries and $n − r$ zero entries.
Why is there a permutation ...
- 11
7
votes
2
answers
261
views
Robust generalization of matrix rank
I am looking for robust generalizations of matrix rank.
Think of the the following problem: A big matrix of low rank is perturbed by random noise, such that it becomes a full-rank matrix. Is there a ...
- 199
2
votes
1
answer
182
views
Heuristics for counting degrees of freedom
I have recently learned about the representation theorem for isotropic,
linear operators, which says the following:
Defintion:
Let $M_n$ be the vector space of $n \times n$ real matrices. We say a ...
- 6,621
4
votes
1
answer
686
views
What is the best algorithm for even rank magic square?
Magic square is a $n*n$ matrix with numbers of $1,2,...,n^2$ and has the property that sum of any row and any column and sum of main diameter and
adjunct diameter is identical. There exists a very ...
- 41
5
votes
2
answers
450
views
Does the antidiagonal in this square matrix always contain a prime?
Does the antidiagonal in the square matrix with entries $1,2,\ldots,n^2$ row by row in that order always contain a prime?
For example:
For n=2: $\begin{bmatrix}1 & 2\\3 & 4\end{bmatrix}$ ...
- 59
7
votes
1
answer
1k
views
Are there infinite constructions for partial circulant Hadamard matrices?
I believe that the circulant Hadamard conjecture (that there are no circulant Hadamard matrices of size greater than $4\times4$) is still open.
I also know that examples of $(n/2) \times n$ matrices ...
- 10.1k
3
votes
1
answer
725
views
Similarity transformation of transition matrix of reversible Markov chain (reference request)
If $P$ is the transition matrix of a reversible Markov chain, and $\pi$ is its stationary distribution, and let $R$ be defined by:
$$R_{ij} = \sqrt{\frac{\pi_i}{\pi_j}}P_{ij}~.$$
By reversibility, ...
- 1,269
2
votes
0
answers
710
views
When does this matrix have full rank?
Suppose $\mathbf{B}\in\left[0,1\right]^{T\times M}$ is a binary matrix,
$\mathbf{B}_{i}$ is a column of $\mathbf{B}$, and $\mathbf{X}\in\mathbb{R}^{N\times T}$
is a matrix where the columns are ...
- 876
0
votes
2
answers
144
views
Simultaneous special orthogonal similarity problem
Given matrices $A,B,C,D\in\Bbb K^{n\times n}$ where $\Bbb K$ is a ring is there an efficient technique to compute set $O$ with $OO'=I$ where $'$ is transpose and $\mathsf{Det}(O)=\pm1$ such that
$$A=...
user76479
0
votes
1
answer
53
views
Making a real matrix positive definite by replacing nonzero and nondiagonal entries with arbitrary nonzero reals
Let $A$ be real square matrix.
Let $\mathcal{F}(A)$ be the set of real matrices $A'$ of the same size such that $A'_{ii}=A_{ii}$ for all $i$, and for all $i,j$, $A_{ij}=0\Rightarrow A'_{ij}=0 \land ...
- 24.2k
4
votes
1
answer
259
views
A partition of the set of all $n\times n\ (0,1)$-matrices
Let $S_n$ be the set of all the $n\times n\ (0,1)$-matrices and divide $S_n$ into two sets as follows:
$A_n=\{M\in S_n:$ there exist a row and a column of $M$ such that the sum of the row is equal to ...
- 1,987
0
votes
0
answers
114
views
A linear combination problem
Given $0/1$ $n\times n$ matrix $M$.
Suppose we have $2$ vectors $\lambda,\mu\in\Bbb R^{1\times n}$ such that both
$$\lambda M\in\{0,1\}^{1\times n}$$
$$M\mu'\in\{0,1\}^{n\times 1}$$
holds with $'$ ...
user76479
1
vote
0
answers
85
views
Keshavan-Montanari-Oh matrix completion — clearing step
I am trying to implement the algorithm for matrix completion proposed by Keshavan, Montanari and Oh (2009). It consists of three steps:
Trimming which nulls some rows and columns to make the high ...
- 31
5
votes
0
answers
179
views
When is a Hermitian matrix of the form $g^*g$ for some matrix $g$
I tried asking this question on Math StackExchange and didn't get any replies. I was hoping that maybe someone here could help, sorry for duplicating.
I'm trying to figure out some properties of ...
- 993
2
votes
1
answer
347
views
Eigenvalues of product of symplectic matrices
I have 2 symplectic matrices $X_{1},X_{2} \in \mathbb{R}^{2n\times2n}$. The matrix $X=X_{1} \cdot X_{2}$ is also symplectic.
Question: Are there any theorems which allow me to express eigenvalues of ...
- 133
5
votes
2
answers
593
views
Is it always possible to "separate" the eigenvalues of an integer matrix?
Call a square matrix Galois-irreducible if all its eigenvalues are Galois conjugates of each other.
Let $M$ be an integer $n\times n$ matrix which is not Galois-irreducible. Is it always possible ...
- 13.2k
9
votes
3
answers
3k
views
Fast Upper Triangular Matrix Exponentiation
Let $Q_n$ be a $n\times n$ matrix with $Q_n=\begin{pmatrix} -\lambda_1-\mu_1 & \lambda_1 & 0 & \cdots\\ 0 & -\lambda_2-\mu_2 & \lambda_2 & \cdots\\ \vdots & \vdots & \...
- 4,902
0
votes
1
answer
993
views
Approximate $\mathbf{G}=(a\mathbf{H}+\mathbf{M})^+$ by Taylor expansion [closed]
Suppose we have a complex matrix $\mathbf{M}$. Let $\mathbf{M}^+=(\mathbf{M}^*\mathbf{M})^{-1}\mathbf{M}^*$ be the pseudo-inverse of $\mathbf{M}$, where $^*$ denotes the conjugate transpose. Let $\...
- 223
3
votes
1
answer
390
views
A particular Lie algebra $L_{n}$ and (various) lie groups whose Lie algebra is isomorphic to $L_{n}$
Edit: According to the comment by @LSpice we realise the existing link to the main motivation of the question is not available. Then we search for the paper we found the following version:
https://www....
- 312
7
votes
1
answer
216
views
Least-squares solution of systems of Sylvester equations
The Sylvester equation $AX+XB=C$ has been studied quite a lot and there are known algorithms for solving it.
But has the situation where (an over-determined) system of equations $A_{i}X+XB_{i}=C_{i}$ ...
- 6,882
20
votes
2
answers
17k
views
Complexity of linear solvers vs matrix inversion
Solving linear equations can be reduced to a matrix-inversion problem, implying that the time complexity of the former problem is not greater than the time complexity of the latter. Conversely, given ...
- 1,159
2
votes
1
answer
353
views
On Knot Equivalence problem statement
How is the knot equivalence problem represented?
By this I mean I am looking for an analogy that compares with graph equivalence. For graph equivalence, we have two graphs $G_1$ and $G_2$ with ...
- 13.7k
5
votes
0
answers
214
views
Existence or construction of a sequence of orthogonal matrices with three properties
This is a problem that I encountered during my research, and I have spent a good amount of time on it without success. So I am reaching out for help ....
Any pointers or suggestions are appreicated!
...
- 934
7
votes
1
answer
403
views
Sum of the absolute eigenvalues of A>=B
Kindly help me to prove/disprove the following statement.
Let $A$ be a symmetric matrix of order $n \times n$ with all the diagonal entry equal to $0$, and other non-diagonal entry equal to $k$ (...
3
votes
3
answers
344
views
Can a block matrix with at least 3 zero blocks of different size on the diagonal and 1's everywhere else have only integer eigenvalues?
Let $M=\begin{pmatrix}
\begin{array}{cccccccc}
0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\
0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\
1 & 1 & 0 & 0 & ...
4
votes
2
answers
460
views
Non-asympototic version of Gelfand's formula
Let $A$ be a $n\times n$ matrix. Let $\|A\|$ be the spectral norm of $A$, and $\rho(A)$ be the spectral radius. I am wondering whether the following statement is true.
There exists universal ...
- 181
13
votes
2
answers
5k
views
Parametrization of positive semidefinite matrices
We know that a real, symmetric, positive definite matrix $A$ of size $n\times n$ can be parametrized by a vector $\theta$ of $\frac{n(n+1)}{2}$ parameters thanks to the Cholesky decomposition:
$$
A = ...
- 313
3
votes
1
answer
3k
views
Uniqueness of the reduced rank QR decomposition
Let $A$ be a $n\times n$ matrix that is a real, symmetric, positive semidefinite and has rank $r$.
I read about the rank reduced $QR$ decomposition (here for example) as the QR variant where $A=QR$ ...
- 313
12
votes
2
answers
2k
views
Factorization of a matrix as a product of a symmetric and a skew-symmetric matrix
When can an $n\times n$ matrix $M$ be written as a product $M=AB$, where $A^T=A$ and $B^T=-B$?
For example, a necessary condition is that the trace of $M$ vanishes. In this case, it is easy to check ...
- 4,304
3
votes
0
answers
87
views
When is $\left[\begin{smallmatrix} D_1 & B \\\\ -B^T & D_2 \end{smallmatrix} \right]$ $\mathbb{R}$-diagonalizable?
Is there some block-wise characterization of $\mathbb{R}$-diagonalizability (by similarities) of
$$\begin{bmatrix} D_1 & B \\\\ -B^T & D_2 \end{bmatrix},$$
where $D_1$ and $D_2$ are real ...
- 300
8
votes
2
answers
341
views
Computer Algebra Systems that support variable sized matrices
I'm familiar with sympy, the matlab symbolic package, reduce, and have tried out a few other computer algebra systems. However, as far as I can tell, none of them seem to be able to do algebra on ...
- 695
2
votes
1
answer
137
views
The action of $GL(\mathbb{R}^{n})\otimes GL(\mathbb{R}^{m})$ on $\mathbb{R}P^{(mn-1)}$
Motivated by the following RG question we ask a related question as follows:
We identify $\mathbb{R}^{n} \otimes \mathbb{R}^{m}$ with $\mathbb{R}^{mn}$. We define $GL(\mathbb{R}^{n})\otimes GL(\...
- 312
12
votes
0
answers
217
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.2k
1
vote
0
answers
259
views
Expected value of minimum rank of random matrices
I have $n$ random vectors ${\bf r}_i$ for $i=1,2,\dots,n$, each with dimension $1 \times m$, and $n$ random matrices ${\bf S}_i$ for $i=1,2,\dots,n$, each with dimension $M \times m$. The elements of $...
- 297
8
votes
2
answers
774
views
generalizations of Vandermonde matrix to high dimensions
Let $x_1,x_2,\cdots,x_n\in\mathbb{R} $ or $\mathbb{C}$. By the non-degeneracy of Vandermonde matrix
the maps
$$
f: \mathbb{R}\longrightarrow\mathbb{R}^n,$$ $$
x\longmapsto (1,x,x^2,\cdots,x^{n-1})...
- 519
10
votes
2
answers
1k
views
The intuition behind the Hilbert projective metric and the Perron Frobenius Theorem
Recently I have read a proof of the Perron Frobenius Theorem for positive aperiodic matrices. In this proof, the trick is to put a metric in the "positive quadrant" of $\mathbb{R}^n$, $\mathbb{R}^{n}_+...
user11178
6
votes
1
answer
212
views
Are the integer matrices in SO(3,2) "boundedly generated"?
Let $G$ be the subgroup of integer matrices in $\mathrm{SO}(3,2)$.
(The invertible linear maps from a $5$ dimensional real vector space to itself which leave invariant a nondegenerate symmetric ...
- 11.2k
9
votes
3
answers
389
views
Integer matrix that does not belong to a free group of rank 2
I'm given two matrices in $SL_2(\mathbb{Z})$
$$
A = \left(\begin{array}{cc}
2 & 3\\
3 & 5
\end{array}\right), \ \
B = \left(\begin{array}{cc}
5 & 3\\
3 &...
- 111
9
votes
1
answer
1k
views
Efficient SVD of a matrix without some of the columns
I have a matrix $A \in \mathbb{R}^{p \times q}$ of rank $r$ and its SVD decomposition, i.e,
$$
A = U S V^\top,
$$
where $U \in \mathbb{R}^{p \times r}$ and $V \in \mathbb{R}^{q \times r}$ are ...
- 341
1
vote
0
answers
129
views
Lower bound on the value $\textbf{1}^Tx$ such as $Ax\geq b$
The problem may be formulated as follows:
We are given a set of $m$ positive numbers $\{b_1,...,b_m\}$ and a set of $n$ positive numbers $\{v_1,...,v_n\}$. We have $v_j\leq K$, $j=1,...,n$, for a ...
- 123
21
votes
1
answer
2k
views
Almost commuting unitary matrices
Suppose that $A_1,\dots, A_k$ are unitary matrices such that any two of them can be approximated by commuting unitary matrices. i.e. for any $i$ and $j$, there are unitary matrices $A_i'$ and $A_j'$ ...
- 901
-1
votes
1
answer
173
views
finding a unitary submatrix inside a random matrix
Let $\mathbf{R} \in \mathbb{C}^{~m \times n} $ with $m \leq n $ be a random matrix, whose entries are i.i.d zero mean random variables with circularly symmetric Normal distribution. Let where $r$ be ...
- 482
2
votes
0
answers
44
views
Nonconvex function on the singular value vectors of projected matrix
For a nonconvex function $p_\lambda(\cdot)$, with hyper-parameter $\lambda$, it can be decomposed into two parts that $p_\lambda(t) = \lambda |t| + q_\lambda(t)$, where $q_\lambda(t)$ is the concave ...
- 31
-1
votes
1
answer
226
views
How bad could $\|A^k\|$ be when $\rho(A) < 1-\delta$ [closed]
(Sorry, I do hate editing this many many times but let me try the last time)
Gelfand's formula says that
$$\lim_{k\rightarrow \infty} \|A^k\|^{1/k} = \rho(A)$$
I am wondering whether there is any ...
- 181