All Questions
Tagged with matrices matrix-theory
248 questions
3
votes
1
answer
234
views
Is there a matrix that has the completely opposite effect of a Hadamard matrix?
First, let me provide some background on the problem:
In the field of Large Language Model quantization/compressions, outliers (abs of outliers are much larger than the mean of abs of all elements in ...
3
votes
1
answer
187
views
Eigenvalues of certain matrices
We write $R(\theta)=\left(\begin{smallmatrix}\cos(2\pi\theta)&\sin(2\pi\theta)\\ -\sin(2\pi\theta)&\cos(2\pi\theta)\end{smallmatrix}\right)$ for any $\theta\in\mathbb R$.
Let $d,m,n,r$ be a ...
7
votes
0
answers
131
views
Approximation of a continuous curve on commuting matrices
I have a continuous curve $A:\mathbf{R}_+\rightarrow \text{M}_N(\mathbf{R})$ such that
$[A(t),A(s)] \operatorname*{\longrightarrow}_{t,s\rightarrow +\infty} 0$, where $[A(t),A(s)] = A(t)A(s)-A(s)A(t)$....
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 $...
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 ...
2
votes
1
answer
157
views
Under row operations and column permutations a matrix A can be put in the non-unique form ( I | X ), what is known about the set of possible X?
Given a full row-rank matrix $A$, this can be put into a unique reduced row echelon form via elementary row operations. Allow column permutations (no column addition / multiplication) and this can be ...
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 ...
2
votes
0
answers
72
views
Gradient descent over the set of complex symmetric matrices
In the course of my research (somewhat related to compressive sensing), I am trying to determine a complex, symmetric matrix $L$ (i.e. $L = L^T$) through the following optimization formulation:
$$ \...
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 ...
1
vote
0
answers
21
views
Correlation Matrix Problem of Three Decomposition Level of DWT
I'm trying to apply a DWT with 3 composition levels and the following question arose when calculating the composition matrix.
The step I'm trying to follow is:
The DWT coefficientes are obtained from ...
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 ...
0
votes
0
answers
131
views
On a matrix equation with Kronecker product
Is there any work on the matrix equation in unknowns $X, Y \in {\Bbb C}^{n \times n}$ $$(X \otimes Y + Y \otimes X) \operatorname{vec}(A)=0$$ where $\otimes$ is the Kronecker product? Or, in general, ...
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 ...
2
votes
0
answers
146
views
What are the name and inverse of an interesting integer matrix?
It is practicable to compute the matrix inverses
\begin{align*}
\begin{pmatrix}
1 & 0 & 0 \\
1 & 1 & 1 \\
1 & 2 & 2^2 \\
\end{pmatrix}^{-1}
&=\begin{pmatrix}
1 & 0 &...
5
votes
2
answers
350
views
How expressive is $e^A$ in the sense of universal approximation?
For any real matrix $B\in\mathbb{R}^{n\times n},n\ge 2$ and precision $\varepsilon$, is there a real matrix $A\in\mathbb{R}^{n\times n}$ such that $\|e^A-B\|_F<\varepsilon$? ($F$ refers to ...
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}(\...
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 $...
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}$, ...
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 ...
8
votes
2
answers
519
views
Orthogonal basis of ${\bf Sym}_n(\mathbb R)$, made of orthogonal matrices
My question is motivated by this one, but within real matrices instead of complex ones.
${\bf Sym}_n(\mathbb R)$ is a vector space of dimension $N=\frac{n(n+1)}2$. Equipped with the scalar product $\...
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)^{...
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 ...
0
votes
0
answers
108
views
On the exponentiation of a stochastic matrix where the exponent is a function of matrix size
In this question, I asked about any arbitrary stochastic matrix $A(n)$ of the particular form
$$A(n) = \begin{pmatrix} 1 & 0 & \cdots & 0\\ x_{21} & x_{22} & \cdots & 0\\ \...
3
votes
0
answers
142
views
Solvability of a matrix exponential equation - generalized matrix logarithm
For a given invertible real matrix $G\in \mathrm{GL}_d$ with $\det G>0$, we ask for a solution $B$ of the matrix exponential equation
$$
G = \exp(B) \exp\bigl(\tfrac{1}{2}(B^T-B)\bigr) .
$$
Basic ...
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 \...
8
votes
7
answers
1k
views
One observation of special type of square matrix exponentiation
I was studying the following type of matrices,
$$
A = \begin{pmatrix}
1 & x_{12} & \cdots &x_{1n}\\
0 & x_{22} & \cdots &x_{2n}\\
\vdots\\
0&\cdots&0&x_{nn}
\end{...
1
vote
1
answer
150
views
eigenvalues of matrices (with positive entries)
I am reading an old paper by Kawpien and Pelczynski, Studia Math. 1970. It claims that singular values of a matrix (with positive entries? I am not sure) is given by $t_i=\sqrt{\sum_{j\ge 1}a(i,j)^2}$....
4
votes
1
answer
266
views
Positive system of algebraic integers
Let $\mathbb{A}$ be the ring of algebraic integers. Consider a sequence $(d_i)_{i \in I}$, with $I$ a finite set and $d_i \in \mathbb{A} \cap \mathbb{R}_{\ge 1}$, such that $$d_i d_j = \sum_{k \in I} ...
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 ...
1
vote
0
answers
162
views
Convex matrix combination
We all know the notion of a convex combination like
$$\lambda x_1 \; + \; (1 - \lambda) x_2$$ for some $\lambda \in (0, 1)$.
However, I am trying to find literature where this concept has been ...
1
vote
0
answers
111
views
Solving a block tridiagonal system with diagonal perturbations
Say we have a block tridiagonal matrix, $T \in \mathbb{R}^{NL \times NL}$, with constant off diagonals, $\mathbf{B} \in \mathbb{R}^{L\times L}$, given by
$$
T = \begin{bmatrix} \mathbf{A}_1 & \...
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 ...
1
vote
0
answers
216
views
Schatten norm inequality
Let $A,B$ be two $n\times n$ matrices.
Find a lower bound of the $p$-th Schatten norm
$\|(A-B)(A-B)^\ast\|_{S_{p/2}}^{1/2}$ in terms of Schatten norm of $\|(AA^*+BB^*)\|_{S_q}$ for any relation ...
0
votes
0
answers
167
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 $...
2
votes
1
answer
316
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 ...
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 ...
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 ...
3
votes
2
answers
354
views
Solving linear matrix equation
Given matrices $A, B, C' \in \Bbb R^{2 \times 6}$, where $'$ denotes matrix transposition, and matrix $L \in \Bbb R^{2 \times 2}$, how can one solve the following linear matrix equation in $X \in \Bbb ...
8
votes
1
answer
286
views
Cardinality of the maximum points of the determinant on matrices with entries in [-1, 1]
By multilinearity, the maximum of the determinant on matrices with entries in the interval [-1, 1] is attained at a {-1, 1}-matrix. By the following example, the maximum is attained at infinitely many ...
4
votes
1
answer
719
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 ...
1
vote
0
answers
106
views
Number of non-singular matrices with entries in $\{1, -1\}$
What is the number of non-singular $n \times n$ matrices with entries in $\{1, -1\}$? Here I assume that two such matrices are equivalent if one can be obtained from the other by permutations of rows ...
2
votes
0
answers
502
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 ...
1
vote
0
answers
79
views
There is an observation on the eigenvalues of the sum of a kind of special Hermitian matrices. How to prove it?
Suppose $A$ and $B$ belong to a kind of special hermitian matrices, which have the following properties:
$A$ and $B$ contain only one negative eigenvalue.
the negative eigenvalue and the second-...
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 ...
7
votes
1
answer
510
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
vote
1
answer
386
views
Upper bound of rank of a matrix
Given a set $U=\{1,\ldots,c\}$, we have $t$-dimensional vector $v_i=(x_1,x_2,\ldots,x_t)$, where $x_j$ is a subset of $U$. We can check that there are $2^{ct}$ above vectors.
Then we construct the ...
2
votes
1
answer
137
views
Existence of matrices with some invertibility properties
Prove that there exists five matrices $B_i \in \mathbb{F}_2^{5\times 10}$, $i\in \{1,2,3,4,5\}$, such that any two $B_i$'s form an invertible matrix in $\mathbb{F}_2^{10\times 10}$.
I am interested ...
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 $...
2
votes
1
answer
156
views
Minimal Laplacian spread of a graph
Laplacian spread of a graph is the difference among the largest and the second smallest Laplacian eigenvalue of the graph. Is there any result or conjecture that discusses about the graphs having ...