Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
299 views

Eigenvalues of a specific matrix

I have a block matrix $$M=\begin{bmatrix} I_0& I_1& \cdots& I_1\\ I_2& I_0& \ddots& \vdots\\ \vdots& \ddots& \...
2 votes
1 answer
68 views

Generating a random matrix with large spark (i.e., each $k$-tuple of columns is linearly independent)

Let $F$ be a field, and let $m, n, k$ be positive integers. Is there an efficient algorithm to compute a uniformly random $m \times n$ matrix $A$ over $k$ such that each $k$-tuple of columns of $A$ is ...
1 vote
0 answers
77 views

Find a vector in the null space of a large dense matrix, where elements in the matrix are not directly accessible

I am working with Conjugate Gradient method to solve for 𝐴𝑥=𝑏, where 𝐴 is an extremely large PSD and Singular matrix. I cannot directly access the elements of 𝐴. The only thing I can do is ...
6 votes
1 answer
151 views

How to construct a skew Hadamard matrix of order 756?

Where can I find the construction for a skew Hadamard matrix of order 756? According to multiple papers (e.g. Koukouvinos and Stylianou - On skew-Hadamard matrices and Seberry - On skew Hadamard ...
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{...
38 votes
10 answers
18k views

Fast matrix multiplication

Suppose we have two $n$ by $n$ matrices over particular ring. We want to multiply them as fast as possible. According to wikipedia there is an algorithm of Coppersmith and Winograd that can do it in $...
2 votes
1 answer
8k views

Properties of eigenvalues of general nonnegative matrices

I am aware, that an answer to this question can be found via Perron-Frobenius theory or something very similar, but unfortunately I am far from being an expert in the field and I am unable to find the ...
19 votes
4 answers
7k views

Sherman-Morrison type formula for Moore-Penrose pseudoinverse

Given an $n\times n$ invertible matrix $\mathbf A$ and two column vectors $\mathbf u$, $\mathbf v\in\mathbb R^n$, suppose that $1 + {\mathbf v}^T {\mathbf A}^{-1}\mathbf u \neq 0$. Then the Sherman-...
18 votes
3 answers
8k views

Number of invertible {0,1} real matrices?

This question is inspired from here, where it was asked what possible determinants an $n \times n$ matrix with entries in {0,1} can have over $\mathbb{R}$. My question is: how many such matrices ...
13 votes
1 answer
2k views

Number of idempotent $n\times n$ matrices over $\mathbb{Z}/m\mathbb{Z}$?

Is there any known formula for the number of idempotent $n\times n$ matrices over $\mathbb{Z}_m:=\mathbb{Z}/m\mathbb{Z}$ ? The number of idempotent matrices over a finite field is well-known and ...
1 vote
1 answer
292 views

Hessian matrix of vectorized matrix product

I need to find the Hessian Matrix of $f(X,Y) = C \operatorname{vec} (A X^{-1} Y)$ where $C$ and $A$ are constant matrices and $X$ and $Y$ are the variable matrices. This would be a vector function of ...
-2 votes
1 answer
183 views

Property of positive semi-definite

Let $A$ is a positive semi-definite matrix like this: $$ A = \begin{bmatrix} 1 & \alpha_{1,2} & \alpha_{1,3} & \alpha_{1,4}\\ \alpha_{1,2} & 1 & \alpha_{2,3} & \alpha_{2,4}\\ \...
0 votes
1 answer
141 views

Vandermonde matrix with polynomials

Let us consider the simple Vandermonde matrix $V_n$ with $V_{ij} = \omega^{(i - 1)(j - 1)}$ where $\omega = e^{2i\pi/n}$. Its well known that for a column vector $A$, $VA$ is equivalent to evaluating ...
26 votes
6 answers
14k views

Deriving inverse of Hilbert matrix

The Hilbert matrix is the square matrix given by $$H_{ij}=\frac{1}{i+j-1}$$ Wikipedia states that its inverse is given by $$(H^{-1})_{ij} = (-1)^{i+j}(i+j-1) {{n+i-1}\choose{n-j}}{{n+j-1}\choose{n-...
5 votes
2 answers
393 views

Trace identity for $2 \times 2$ reflections [closed]

Let $A, B, C \in \mathrm{GL}(2,\mathbb{C})$ be reflections (i.e., their eigenvalues are $\pm 1$). Please show that $$ \DeclareMathOperator\Tr{Tr}\{\Tr(AB)\}^2+\{\Tr(BC)\}^2 + \{\Tr(CA)\}^2 - \{\Tr(AB)\...
10 votes
1 answer
319 views

Construction of skew-Hadamard matrix of order 292

I am currently looking into how to construct a skew-Hadamard matrix of order 292. Where can I find such construction? According to multiple papers (e.g. Koukouvinos and Stylianou - On skew-Hadamard ...
11 votes
1 answer
1k views

A square root inequality for symmetric matrices?

In this post all my matrices will be $\mathbb R^{N\times N}$ symmetric positive semi-definite (psd), but I am also interested in the Hermitian case. In particular the square root $A^{\frac 12}$ of a ...
1 vote
1 answer
107 views

Convergent condition of the high-dimensional submatrix of some orthogonal matrix

Let $\mathbf{V}$ be a $p\times p$ orthogonal matrix (i.e., $\mathbf{V}\mathbf{V}^\top = \mathbf{V}^\top \mathbf{V} = \mathbf{I}$) whose columns are $$ \mathbf{V} = \begin{bmatrix} \mathbf{v}_1 & \...
4 votes
1 answer
187 views

largest eigenvalue of the difference between two quadratic forms

Let $U,V\in\mathbb{R}^{4\times n}$ such that $UU^T=VV^T=I$, and $A\in\mathbb{R}^{n\times n}$ be an Hermitian matrix. Is it true that $$\sqrt{\lambda_{\text{max}}\left(\left(UAU^T-VAV^T\right)^2\right)}...
21 votes
1 answer
653 views

Characteristic polynomial of the Gcd matrix

Let $A_n$ be the $n \times n$-matrix with entries $\gcd(i,j)$ and $f_n$ the characteristic polynomial of $A_n$. Question: Is $f_n$ irreducible over $\mathbb{Q}$ for all $n$ except $n=8$? This is ...
8 votes
1 answer
1k views

Why does an invertible complex symmetric matrix always have a complex symmetric square root?

Chapter XI Theorem 3 from here implicitly states that an invertible complex symmetric matrix always has a complex symmetric square root. It's clear that a square root exists, by appealing to the ...
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
2 answers
640 views

$2$-norm of idempotent matrix

Suppose $n > 1$ is an integer. Let $P \in \mathbb C^{n \times n}$ be a matrix such that $P^2=P$ and $1\leqslant {\rm rank}(P)<n$. Prove that $\Vert P \Vert_2 = \Vert I - P \Vert_2$. I have been ...
3 votes
0 answers
295 views

Decomposition of a determinant

Let $M$ be a $4\times 4$ symmetric matrix whose entries $m_{i,j}$ for $i,j =1,\dots,4$ are homogeneous polynomials of degree $2$ in $3$ variables. Assume that $m_{1,1} = 0$. Does there exist a ...
10 votes
2 answers
7k views

Bounding the trace of a matrix product by the operator norms; generalized Hölder inequality?

$\DeclareMathOperator\Tr{Tr}$Let $A_i$ with $i=1,\dotsc,N$ and $p$ be real $M\times M$ matrices. Further, let $p$ be positive definite, i.e., $p\succ 0$, with $\Tr(p)=1$. Let $0< a_i<1$ and $\...
7 votes
2 answers
244 views

Finding $\theta$ such that at least one eigenvalue of $A(\theta)$ is real

Is there a known method to find a set of $\theta$ such that at least one eigenvalue of $A(\theta)$ is purely real? Assume $A(\theta)$ is a real square matrix whose elements are linear functions of a ...
2 votes
0 answers
233 views

Do you know this formula for the scalar product in barycentric coordinates?

I've found a formula for a scalar product in barycentric coordinates which I think is pretty cool. I hope that it's new. Is it? Suppose that you have points $x_1,\dots,x_n$ sitting in general position ...
3 votes
2 answers
840 views

An inequality for the spectral radius of block matrices

Let $d,m$ be positive integers. Suppose that $A_{i,j}$ is a $d\times d$-matrix with real entries whenever $i,j\in\{1,\dots m\}$. Let $A$ be the $dm\times dm$ matrix that can be written as a block ...
2 votes
0 answers
97 views

How to decompose a matrix over a ring $F[X_1,\ldots,X_k]$ as a product of two matrices

Let $F$ be a field. Assume any reasonable conditions if needed, such as $F=\mathbb R$, $F=\mathbb C$, $F$ is a finite field, or $F$ has a specific characteristic, etc. Let $C$ be an $n\times1$ matrix ...
1 vote
2 answers
446 views

Transforming matrix to off-diagonal form

I wonder if one can write the following matrix in the form $A = \begin{pmatrix} 0 & B \\ B^* & 0 \end{pmatrix}.$ The matrix I have is of the form $$ C = \begin{pmatrix} 0 & a & b & ...
4 votes
0 answers
161 views

Algorithm for generalized Hilbert's Theorem 90 over $\Bbb R$

$\newcommand{\GL}{\operatorname{GL}} \newcommand{\R}{{\Bbb R}} \newcommand{\C}{{\Bbb C}} $For a natural number $n$, let $z\in \GL(n,\C)$ be a 1-cocycle of $G=\GL_{n,\R}\,$, that is, an invertible ...
1 vote
0 answers
42 views

Enumerate all possible sign patterns spanned by matrix column space

Given a $m \times n$ matrix $A$ with $m>n$, I would like to enumerate all possible sign patterns $w$ generated by $Av$ for all $v \in \mathbb{R}^n$. More specifically, if $(Av)_i \geq 0$ then $w_i =...
1 vote
0 answers
49 views

Bounds on Eigenvalues After Skew-Symmetric Perturbation

Consider two matrices $\mathbf{J} \in \mathbb{R}^{n \times n}$ and $\mathbf{L} = -\mathbf{L}^T \in \mathbb{R}^{n \times n}$. I am trying to upper bound the eigenvalues of their sum: $$\mathbf{A} = \...
1 vote
0 answers
129 views

Kernel of a Vandermonde type matrix

Consider a complex matrix $A\in\mathbb{C}^{n+1\times m}$ such that $$ A=\begin{bmatrix} 1 & 1 & \dots & 1\\ Bc_1 & Bc_2 & \dots & Bc_{m} \end{bmatrix}, $$ where $c_1,\dots ,...
3 votes
2 answers
393 views

Eigenvalues and eigenvectors of non-symmetrical tridiagonal matrix

The question is the following: given a matrix $$A=\begin{pmatrix} 1& 2 & & & & \\ 1& 0& 1 & & & \\ & 1& 0& 1 & &\\ & &...
3 votes
2 answers
438 views

Reducing $9\times9$ determinant to $3\times3$ determinant

Consider the $9\times 9$ matrix $$M = \begin{pmatrix} i e_3 \times{} & i & 0 \\ -i & 0 & -a \times{} \\ 0 & a \times{} & 0 \end{pmatrix}$$ for some vector $a \in \mathbb R^3$, ...
34 votes
3 answers
6k views

Why is uncomputability of the spectral decomposition not a problem?

Below, we compute with exact real numbers using a realistic / conservative model of computability like Type Two Effectivity. Assume that there is an algorithm that, given a symmetric real matrix $M$, ...
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 ...
2 votes
1 answer
244 views

Expected minimal distance of eigenvalues

Let $A$ be an arbitrary symmetric matrix and $B$ be a random GUE matrix. I would like to know. Are there any results on the minimal eigenvalue distance between two distinct eigenvalues of $A+B$? I ...
-1 votes
1 answer
155 views

Companion matrices must have geometric multiplicity one, linear recurrence sequence view [closed]

I posted this question on math stackexchange weeks ago, and it have not receive an answer yet after a bounty offer... I've been recently playing around with the linear recurrence sequences. Consider ...
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 \...
6 votes
1 answer
883 views

One question on block-circulant matrices

Circulant matrices are very useful in digital image processing. I found the general formula for determinant of circulant matrix. But I think it is not suitable for block-circulant matrices. For ...
5 votes
1 answer
319 views

Analytical form for the nuclear norm of an $n \times n$ matrix

I get the follow equation in a paper. Let $A \in \mathbb{R}^{2 \times 2}$, then $M = A^TA$ is a positive semi-definite matrix, the nuclear norm of $A$ is: $$ \Vert A \Vert_* = \sqrt{\operatorname{tr}(...
1 vote
0 answers
163 views

An estimation of the largest eigenvalue of a submatrix of $\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$

Let us consider the following matrix $A=(a_{k,l})$ where $$A=\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$$ Let us consider the submatrix $A_0$ of $A$ whose entries are those $a_{k,l}$ where $k\...
2 votes
0 answers
88 views

Nuclear norm minimization of convolution matrix (circular matrix) with fast Fourier transform

I am reading a paper Recovery of Future Data via Convolution Nuclear Norm Minimization. Here, I know there is a definition for convolution matrix. Given any vector $\boldsymbol{x}=(x_1,x_2,\ldots,x_n)^...
9 votes
1 answer
953 views

Is there always a complete, orthogonal set of unitary matrices?

The set of size-$n$ unitary matrices span $\Bbb C^{n \times n}$ (this can be proven nicely using polar decomposition). If we select a maximal linear subset of unitary matrices, then we have a basis ...
0 votes
0 answers
232 views

How to analyse the range of eigenvalues of a symmetric and indefinite matrix?

Let $G$ be a symmetric and indefinite matrix defined as follows $$ G := S - \begin{pmatrix} I_n & I_n \\ I_n & I_n \end{pmatrix},$$ where $S$ is a symmetric positive definite matrix of size $...
1 vote
1 answer
296 views

A query about modular arithmetic on a matrix

Given a matrix $M$ that consists of a set of $4K$ binary row vectors (each vector entry is 0 or 1) each of length $K$. Moreover, it is known/promised that no subset of rows in matrix add to an all 1 ...
1 vote
0 answers
67 views

Representation of an N player game with 2 strategies per player as a matrix and its properties

Is there any well-studied representation of a N player game with 2 strategies per player as a matrix? Intuitively, I think that each strategy can be represented as a binary digit, and each strategy ...
10 votes
3 answers
680 views

Direct product of free groups in $\mathrm{SL}_3(\mathbb{Z})$

Let $\mathbb{F}_2$ be the free group on two generators. Does $\mathbb{F}_2 \times \mathbb{F}_2$ embed as a subgroup of $\mathrm{SL}_3(\mathbb{Z})$?

1
3 4
5
6 7
34