All Questions
142 questions
7
votes
1
answer
388
views
Questions on symmetric Hadamard matrices
Definitions: An $n\times n$ Hadamard matrix (HM for short) is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal.
If $A$ is a symmetric matrix, then $A = A^T$ and if $...
- 696
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
1
vote
0
answers
45
views
Rank of Hadamard product of column-wise polynomial evaluations and row-wise exponential evaluations
Consider the Hadamard product $A \odot B$ between two special matrices $A,B \in \mathbb{R}^{n \times m}$. The columns of $A$ are evaluations of polynomials, while the rows of $B$ are evaluations of ...
- 21
0
votes
0
answers
32
views
Eliminating nullity for enhanced non-singularity
If we have an
$n\times n$ matrix $A$ with entries either $0$ or $1$, where all diagonal entries are $0$ and the rank is $k<n$, can we reach full rank by changing exactly $n-k$ zero off-diagonal ...
- 4,058
1
vote
0
answers
255
views
Interpreting positive semidefinite matrix as a graph
Given any symmetric matrix $S \in \mathbb{R}^{n \times n}$, if $S \succeq 0$, is there a way to encode $S$ into a graph such that it takes into account the positive semidefinite constraint, and ...
- 275
2
votes
1
answer
264
views
Continuous path of unitary matrices with prescribed first column?
Consider a continuous curve $u \colon [0,1] \to \mathbb{C}^n$ where $u(t)$ is always a unit vector, $u(t)^* u(t) = 1$.
Question 1: Does there exist a continuous curve $U \colon [0,1] \to \mathbb{C}^{n ...
- 637
2
votes
0
answers
137
views
Decompose a rational matrix as an integer matrix and an inverse of integer matrix
Suppose we have a non-singular rational matrix $Q$, consider the the $\mathbb{Z}$-span of the columns of $Q$ and $Q^{-1}$, denote it as $H = {\rm Span}_{\mathbb Z} \{ Q(\mathbb Z^{n}), Q^{-1}(\...
- 823
1
vote
2
answers
137
views
Methods to solve for a matrix whose entries satisfy certain properties
(This question is a repost of a deleted question I asked, because the previous version had several elements missing)
Setting
For fixed $N \in \mathbb{N}$, I wish to compute the entries of a matrix $...
- 135
1
vote
0
answers
154
views
Some kind of product of two 2d tensors to create a 3d tensor?
I recently need to apply the following concept of product of two 2d tensors to create a 3d tensor (tensors understood as generalized arrays):
given two 2d tensors $A_{m\times n}$ and $B_{n\times p}$, ...
- 461
1
vote
1
answer
141
views
Minimal number of linearly dependent rank-1 projectors
What is the minimal number of linearly dependent rank-1 projectors $\vec v \vec v^t$ in dimension n, under the condition that every set of n column vectors $\vec v$ is linearly independent.
PS: the ...
- 1,207
4
votes
0
answers
98
views
A question on products of linear combinations of complex matrices
Suppose that $A_1, \dots , A_n, B_1, \dots , B_n \in \Bbb C^{d \times d}$ and that, for every $x \in \mathbb{C}^n$, the following holds
$$\left( \sum_i x_i A_i \right) \left( \sum_i x_i A_i \right)^{...
- 69
0
votes
1
answer
224
views
Faulty algorithm for simultaneous diagonalization?
I found a simple algorithm for simultaneous diagonalization of two commuting matrices (Nordgren - Simultaneous Diagonalization and SVD of Commuting Matrices), which seemed to be well-founded. For ...
- 103
3
votes
1
answer
144
views
On the bounds of the sum of the squares of spectral variation of two real symmetric matrices
Suppose $A$ and $B$ are two symmetric real $\{0,1,-1\}$ matrices of order $n$ with diagonal elements as zeros (therefore the traces are zeros) and eigenvalues $\lambda_1\ge \lambda_2\ge \dotsb \ge \...
- 61
1
vote
1
answer
70
views
A question about the sign of quadratic forms on nonnegative vectors
Let $M$ be a real square matrix of order $n\ge 3$.
Assume that for every nonnegative vector $\textbf{z}\in \mathbb R^n$ which has at lease one zero entry we have $\textbf{z}^T M \textbf{z} \ge 0$.
Can ...
- 13
9
votes
1
answer
253
views
Linear subspaces of $\mathrm{GL}_n(\mathbb{R})$ whose inverses are also linear subspaces
$\DeclareMathOperator\GL{GL}$We will call a subset $S \subset \GL_n(\mathbb{R})$ a linear subspace if it is of the form $S = S'\cap \GL_n(\mathbb{R})$ for some $S'\subset M_n(\mathbb{R})$ which is a ...
- 2,178
0
votes
0
answers
168
views
Multiplying by Loewner-ordered matrices
Suppose $A$ and $B$ are symmetric positive (semi-)definite, and $A<B$ in Loewner order, meaning $B-A$ is positive (semi-)definite. Is it true that, for a symmetric positive-definite $C$, we have $...
- 93
2
votes
1
answer
317
views
Classification of congruent integer matrices
I am interested in the following question:
Let $A,B\in\text{Mat}(2n\times2n;\mathbb{Z})$ be two integer matrices with the property that $\text{det}(A-A^T)=1=\text{det}(B-B^T)$. Are there known ...
1
vote
0
answers
42
views
What is the complexity of the matrix multiplication closure for a given generating system?
Given a generating set of $k$ matrices $X = \{M_1, M_2, \ldots, M_k\}$, with $M_i\in \mathrm{Mat}(\mathbb{C},n)$, what is the worst case complexity for computing the algebraic closure w.r.t. matrix ...
- 21
1
vote
0
answers
146
views
Identities for the determinant of a matrix similar to $\det(A)=\exp\circ\operatorname{tr}\circ\log(A)$ for different matrix functionals
The identity for the determinant of $A$ in the title is well know in matrix analysis and comes from the Jacobi's formula. I am interested in the existence of nontrivial formulas like this one (they do ...
- 573
0
votes
0
answers
92
views
Classification of elements $GL(d, \mathbb{R})$
Any $SL(2, \mathbb{R})$ is either elliptic or hyperbolic, or parabolic up to conjugacy; see here.
Do we have the same classification for $GL(d, \mathbb{R})$? If so, could you please introduce some ...
- 1,043
4
votes
1
answer
720
views
Singular value decomposition of truncated discrete Fourier transform matrix
Let $\mathbf{F}$ be a discrete Fourier transform (DFT) matrix such that
\begin{align}
F_{m,n}=e^{-j2\pi(m-1)(n-1)/N},\quad m,n=1,\ldots,N.
\end{align}
What we can say about the singular value ...
- 287
2
votes
0
answers
504
views
Finding a basis for the range of a linear function
I realize this question is not high level but I have posted it on Math Stackexchange:
Stackexchange question
and have received some upvotes but no answers or comments, so I am trying here.
I will need ...
- 121
2
votes
0
answers
112
views
Product of two involutions in $\mathrm{PSL}_2(D)$
Let $D$ be a division ring and $\mathrm{PSL}_2(D)$. Suppose that $\overline{A}\in\mathrm{PSL}_2(D)$ where $A\in \mathrm{SL}_2(D)$. If $\overline{A}$ is identity, then $\overline{A}$ can express two ...
- 141
7
votes
1
answer
511
views
Is it true that $\lVert A\rVert \leq \lVert A^2\rVert$ for $A\in \operatorname{SL}(2, \mathbb{R})$ when $\operatorname{trace}(A)>2$?
$\DeclareMathOperator\SL{SL}\DeclareMathOperator\trace{trace}$Let $A \in \SL(2,\mathbb{R})$ and $\trace(A)>2$. Is it true that $$\lVert A\rVert \leq \lVert A^2\rVert,$$
where $\lVert \rVert$ is the ...
- 1,043
3
votes
1
answer
102
views
Multiplicative identity of determinant of multiplicative action of a polynomial on a quotient ring (companion matrices)
Let $A$ be a commutative ring with $f,g\in A[x]$ monics. Consider the $A$-linear endomorphism $\mu_g^{(f)}\in \mathrm{End}_A\tfrac{A[x]}{\langle f\rangle}$ given by multiplication by $g$.
For monics $...
- 10.5k
14
votes
1
answer
751
views
Is this "semi-tensor product" something recently invented? Are there other usages of it?
The context: I was reading a paper in which they used the following definition called "Semi-Tensor Product" (STP) or "Cheng" product (In honor to its "inventor" D. Cheng):...
- 344
3
votes
1
answer
2k
views
Eigenvalues of a block matrix with zero diagonal blocks
Suppose $A$ is a $k_1\times k_2$ matrix with real entries, $k_1<k_2$. Let $M$ be the matrix
\begin{equation}
M:=\begin{pmatrix}
0_{k_1} & A\\ A^\top & 0_{k_2}
\end{pmatrix},
\end{equation}
...
- 53
3
votes
1
answer
740
views
Operator norm of difference of matrix decompositions
This question is in part related to a question that I have already posed.
Say I have two symmetric positive definite matrices and their respective Cholesky decompositions $\mathbf{A} = \mathbf{L}_A \...
- 55
2
votes
0
answers
176
views
System of matrix equations
Problem definition: Let $x_i \in \mathbb{R}^d$ and $a_i \in [0,1]$, for all $i = 1,\dots, k$ (with $k\geq d$). Define $M(a) = \sum_{i = 1}^k a_i x_ix_i^T,$ and assume $M(a) \succ 0.$
Question: Is ...
- 245
2
votes
0
answers
99
views
When does a matrix subspace contain a full rank matrix?
Cross-posted at Math SE
Let $S\subseteq M_{n,m}(\mathbb{C})$ be a $d$-dimensional subspace of the space of $n\times m$ complex matrices (with $n\leq m$, say). I am interested in figuring out ...
- 131
1
vote
1
answer
187
views
Existence of matrices in the field $\mathbb{F}_2$ with some invertibility properties
All the matrices in this statement are in the field $\mathbb{F}_2$. Let $I$ be the identity matrix of size $10 \times 10$ and let $e_1$, $e_2$, $\ldots$, $e_{10}$ denote its rows. For $i\in \{1,5 \}$, ...
user83947
1
vote
0
answers
373
views
Upper bound on the sum of the smallest non-zero eigenvalues
Let $\mathcal A := \{ A_1, A_2, \dots, A_n \} \subset \Bbb R^{d \times d}$ be a set of symmetric and positive semidefinite matrices.
For a matrix $A_k \in \mathcal A$, denote its (real) eigenvalues by ...
- 245
2
votes
0
answers
55
views
Does there always exist a(n uniform) polynomial that makes a positive definite symmetric matrix with polynomial entries into a sum of squares?
Suppose that I have a square and positive definite for every evaluation $x\in\mathbb{R}^{n}$ symmetric matrix $M(x)\in(\mathbb{R}[x])^{s\times s}.$
Does there always exist a polynomial $p(x)\in\...
- 573
1
vote
0
answers
57
views
For which sets of linearly independent complex matrices does there exist a vector whose image set under the given matrices is linearly independent?
For which sets $\{A_i \}_{i=1}^n \subseteq M_d$ of linearly independent $d\times d$ complex matrices does there exist a vector $v\in \mathbb{C}^d$ such that $$\text{dim} [\text{span}\{A_1v, A_2v, \...
- 131
8
votes
1
answer
341
views
General Sylvester's linear matrix equation
For what conditions on $A$, $B$ and $C$ (square matrices of size $n$) would there be a unique solution to
$$
ABX + AXC + XBC = D,
$$
for any $D$? Can one expect a characterization similar to the ...
- 1,216
2
votes
0
answers
226
views
Which matrix decompositions feature permutation matrices?
It's well known that LU decomposition is only numerically stable if it's combined with row and/or column pivoting. It makes me wonder if there are other matrix decompositions that can profitably be ...
- 4,943
4
votes
1
answer
126
views
How to compute an indefinite generalisation of QR decomposition
Given an arbitrary complex matrix $M$ and real, diagonal but possibly indefinite matrix $\Delta$, the problem is to solve the following system of equations:
$$\begin{aligned}
M^*\Delta M &= LD^2L^*...
- 4,943
1
vote
2
answers
143
views
If $x \ge 0$ and $\mathbf{1}^Tx \le \|x\|^2$ then $\mathbf{1}^T(I - xx^T / \|x\|^2) \mathbf{1} \ge \| [\mathbf{1} - x]_+ \|^2$
Notation. Denote $\mathbf{1}=(1,1,\ldots,1)$ as the vector-of-ones in $\mathbb{R}^n$. Write the "positive part" as $[\alpha]_+ = \max\{\alpha,0\}$ for $\alpha\in\mathbb{R}$ and $[(x_1,x_2,\...
- 570
1
vote
1
answer
326
views
For the purposes of solving linear equations, is there a fast decomposition that works for all Hermitian matrices?
Let $A$ be an arbitrary Hermitian matrix. Is there a way of efficiently factorizing $A$ for the purposes of solving $Ax = b$ for arbitrary $b$?
There are two decompositions I'm aware of that nearly ...
- 4,943
1
vote
1
answer
162
views
Are there any results in generalizing matrix theory to multidimensional arrays? [closed]
In matrix theory(2-dimensional arrays), we can define addition, multiplication, rank and determinants etc.
I'm working on generalizing these properties to multidimensional arrays as many as possible. ...
- 775
6
votes
3
answers
256
views
Determine unknown matrix function of particular form from known points
I encountered the following problem recently in a practical context.
Fix $n \ge 1$.
Suppose $f$ is an unknown function $\mathbb C ^ {n \times n} \to \mathbb C ^ {n \times n}$ of the form
$$ X \mapsto ...
user167785
1
vote
1
answer
452
views
About the Hadamard conjecture
On the wikipedia article about Hadamard Matrix it says that "The smallest order that cannot be constructed by a combination of Sylvester's and Paley's methods is $92$"
But it also says that ...
- 27
4
votes
3
answers
239
views
Properties of matrix $X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}$
Let $\{\alpha_i\}_{i=1}^n$ be complex numbers such that $|\alpha_i|<1$, and consider the following $n\times n$ structured matrix
$$
X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}.
$$
Such ...
- 2,712
0
votes
0
answers
101
views
Find occurrences of certain matrix inside a matrix
This problem occurred from my need to find all graphs with a certain topology inside a bigger one. I don't need the subgraphs but the graphs that have the exact topology I am searching.
We know for ...
- 101
0
votes
0
answers
59
views
A system of inequalities involving a skew-symmetric integer matrix
Which skew-symmetric integer matrices $S$ satisfy the following inequalities
$SV_i \ne z_iE_i$ for all $i = 1,\cdots, n$
where
$V_i$ denotes the column with integer entries such that the $i$-th ...
- 356
2
votes
0
answers
172
views
Minimum of $\mathrm{rank}\left( \boldsymbol{W} \boldsymbol{H} \right)$, with $\boldsymbol{W}$ block diagonal
Let us assume that we have a full-rank $(n\cdot l)\times k$ matrix, $\boldsymbol{H}$, with no specific structure (e.g., a realization of a Gaussian i.i.d. random matrix), and an $m\times (n\cdot l)$ ...
- 61
2
votes
1
answer
344
views
Joint convexity of trace of matrices
Let $\Gamma_{m\times m}$ be a diagonal matrix with positive diagonal entries and $\mathbf{A}_{m\times m}$ be an arbitrary matrix. Then, is the following trace function jointly convex on $\Gamma_{m\...
- 287
8
votes
3
answers
663
views
Representation theorem for matrices (reference request)
Motivation. If $A \in \mathbb{C}^{n \times n}$ is self-adjoint (or, more generally, normal), then we all know that
$$
A = \sum_{k=1}^n \lambda_k \, h_k \otimes h_k,
$$
where $\lambda_1,\dots,\lambda_n$...
- 12.5k
0
votes
1
answer
91
views
Choosing the best submatrix
Let $\mathbf{A}_{m\times n}$ be a matrix with non-negative elements. Assume that a submatrix $\mathbf{B}$ from $\mathbf{A}$ is defined as
\begin{align}
B_{i,j} =
\begin{cases}
A_{i,j}, & i\in\...
- 287
0
votes
0
answers
96
views
Eigenvalues of the matrix obtained by letting some of the rows vanish, hoping for some inequality
Let $A$ be an $n \times n$ matrix. Let $A_k$ be the matrix obtained by keeping the first $k$ rows of $A$ fixed and substituting $0$ for the rows $k+1$ to $n$. To be precise, we write $A= [R_1...R_k, ...
- 1,465