Skip to main content

All Questions

Filter by
Sorted by
Tagged with
44 votes
2 answers
2k views

Fermat's Last Theorem for integer matrices

Some years ago I was asked by a friend if Fermat's Last Theorem was true for matrices. It is pretty easy to convince oneself that it is not the case, and in fact the following statement occurs ...
Luis Ferroni's user avatar
  • 1,889
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 $...
ilyaraz's user avatar
  • 1,791
36 votes
2 answers
32k views

Eigenvalues of the product of two symmetric matrices

This is mostly a reference request, as this must be well-known! Let $A$ and $B$ be two real symmetric matrices, one of which is positive definite. Then it is easy to see that the product $AB$ (or $BA$...
kjetil b halvorsen's user avatar
29 votes
6 answers
10k views

how to find/define eigenvectors as a continuous function of matrix?

I asked this (with background) here https://stats.stackexchange.com/questions/38494/principal-component-analysis-bootstrap-and-probability-of-eigenvalue-collision but did not really get any answers. ...
kjetil b halvorsen's user avatar
27 votes
3 answers
13k views

What is known about the distribution of eigenvectors of random matrices?

Let $A$ be a real asymmetric $n \times n$ matrix with i.i.d. random, zero-mean elements. What results, if any, are there for the eigenvectors of $A$? In particular: How are individual eigenvectors ...
Andrew's user avatar
  • 433
26 votes
1 answer
1k views

Real square roots of symmetric matrices

In joint work with Andreas Fischle (TU Dresden, Germany) and Patrizio Neff (U Essen, Germany) we needed to use the following statement: If $S$ is a real $n\times n$ matrix with $S^2$ symmetric, then ...
Lev Borisov's user avatar
  • 5,186
20 votes
2 answers
1k views

Find $Y\in\operatorname{GL}_n(\mathbb{Z})$ such that all eigenvalues of $YX$ are nonnegative

I saw this problem some years ago and I would greatly appreciate any reference or solution. Let $X \in \operatorname{M}_n ( \mathbb{R} )$. Prove that there is $Y \in \operatorname{M}_n ( \mathbb{Z} )$...
jack's user avatar
  • 3,153
17 votes
2 answers
1k views

The GCD-matrix: generalizing a result of Smith?

Let $M$ be the $n\times n$ matrix, known as the GCD matrix, of entries $M_{ij}=\gcd(i,j)$. In the paper H J S Smith, On the value of a certain arithmetical determinant, Proc. London Math. Soc. 7:208-...
T. Amdeberhan's user avatar
16 votes
4 answers
3k views

How many minors I need to check to conclude all minors will vanish ?

Given a $m \times n$ matrix $n>m$, I was trying to check if all its $m \times m$ minor vanish. I remember hearing that one really does not need to check all possible minors in order to conclude ...
Vagabond's user avatar
  • 1,795
16 votes
3 answers
791 views

Random products of projections: bounds on convergence rate?

The von Neumann-Halperin [vN,H] theorem shows that iterating a fixed product of projection operators converges to the projector onto the intersection subspace of the individual projectors. A good ...
Martin Schwarz's user avatar
15 votes
4 answers
4k views

Kernel of skew-symmetric matrix of rank $n-1$ with $n$ odd: is this a known result?

When $n$ is odd, the kernel of a skew-symmetric matrix $M$ of size $n\times n$ and rank $n-1$ is the span of $v$, where $v$ is a vector whose $i$-th component is the Pfaffian of the matrix obtained by ...
anderstood's user avatar
14 votes
4 answers
3k views

Vandermonde matrix is totally positive

A totally positive matrix $M\in \mathcal{M}_{n\times m}(\mathbb R)$ is such that all of its minors of all sizes are positive. It is true that any Vandermonde matrix (with well-ordered positive entries)...
Loïc Teyssier's user avatar
13 votes
1 answer
1k views

An inequality for the spectral radius of matrices used by J. Bochi

I am interested in the history of an inequality for the spectral radius of a $d\times d$ real or complex matrix, which occurs in Jairo Bochi's 2002 article Inequalities for numerical invariants of ...
Ian Morris's user avatar
  • 6,206
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 $...
Mare's user avatar
  • 26.5k
11 votes
3 answers
918 views

yet another determinant and inverse of a matrix

This problem is some variation of another MO question. Consider the matrix $$M_n:=\begin{bmatrix}-c& a & a& \dots & a \\ b & c & a& \ddots & a\\ b & b & -c &...
T. Amdeberhan's user avatar
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 ...
leo monsaingeon's user avatar
11 votes
1 answer
632 views

How do computer algebra packages like Sagemath implement rank of a matrix

I am not sure if this is the right place to ask this question, but I believe there will be people here who do computations on computer algebra packages like Sage in their work. I have been using ...
Nikhil's user avatar
  • 263
10 votes
3 answers
830 views

Find the inverse of a matrix that is very similar to the Hilbert matrix

The standard Hilbert matrix $H$ is given by $$H_{ij}=\frac{1}{i+j-1},$$ and it has an inverse given for example in this MO question. Now I have encountered a matrix $M$ of similar form, namely, $$...
Dings's user avatar
  • 153
10 votes
1 answer
537 views

Coefficient-wise powers of matrices. Reference wanted

Let $K$ be a commutative field and ${\rm M}_n (K)$ be the ring of $n\times n$ square matrices with coefficients in $K$ ($n\geqslant 1$ is an integer). For $k\geqslant 1$ and $A =(a_{ij})_{1\leqslant i,...
Paul Broussous's user avatar
10 votes
1 answer
520 views

Homogeneous polynomials, mixed determinants, positive definiteness

Are there $n\times n$ real matrices $A_{1}, \ldots, A_{n}$ such that the $n$-homogeneous polynomial $$ f(x_{1}, \ldots, x_{n}) = \det(x_{1} A_{1}+\cdots +x_{n} A_{n}) $$ never vanishes on $\...
Paata Ivanishvili's user avatar
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 $...
Grigory Yaroslavtsev's user avatar
9 votes
1 answer
472 views

$M = AA^t$ where $A$ has unit norm columns

Let $M \in \mathbb{R}^{k\times k}$ positive definite with $\operatorname{tr} M = m$, where $m$ is an integer such that $m \geq k$. I have found a way (using this answer) to decompose $M = AA^t$ with $...
Yair Daon's user avatar
  • 185
8 votes
2 answers
2k views

Bounding the minimum singular value of a block triangular matrix

Question: What is the sharpest known lower bound for the minimum singular value of the block triangular matrix $$M:=\begin{bmatrix} A & B \\ 0 & D \end{bmatrix}$$ in terms of the properties ...
Nick Alger's user avatar
  • 1,160
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$...
Jochen Glueck's user avatar
8 votes
2 answers
949 views

Best known bounds on (border) ranks of small matrix multiplication tensors?

The $(m,n,p)$-matrix multiplication tensor is a representation of the bilinear map $T\colon\mathbb{R}^{m\times n}\times\mathbb{R}^{n\times p}\rightarrow\mathbb{R}^{m\times p}$ given by $T(A,B)=AB$. ...
Dustin G. Mixon's user avatar
8 votes
1 answer
323 views

On a matrix inequality

$\newcommand{\R}{\mathbb R}\newcommand{\tr}{\operatorname{tr}}$It follows from Proposition 7 and this recent answer that, for any positive-definite $n\times n$ symmetric real matrices $A$ and $B$, $$\...
Iosif Pinelis's user avatar
7 votes
3 answers
1k views

Determinant of correlation matrix of autoregressive model

I wonder if there is a paper that can point out how to compute the determinant of a $d \times d$ autoregressive correlation matrix of the form $$R = \begin{pmatrix} 1 & r & \cdots & r^{d-...
Nikolayevich's user avatar
7 votes
2 answers
251 views

What methods do we have to understand the spectrum of matrices with restricted entries?

Consider questions of the form (or the "most probable value of" version of these questions rather than the "largest possible"), What is the largest possible spectral radius of a $...
user6818's user avatar
  • 1,893
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 \...
Jochen Glueck's user avatar
6 votes
1 answer
239 views

Attempts to define a matrix exponential over (as much as possible) general fields

Given a $n \times n$ matrix $A$ over the complex numbers, the exponential of $A$ is defined as $$\exp(A) := \sum_{k = 1}^\infty \frac1{k!} A^k , \qquad \tag{$\star$}\label{468645_star}$$ where ...
rosan98's user avatar
  • 361
6 votes
1 answer
192 views

Monte-Carlo computation of the Smith normal form

Quite some time ago I saw an article where a Monte-Carlo algorithm for computing the Smith normal form of an integer matrix was described. In this article the following problem was posed: Suppose $P, ...
Jan-Christoph Schlage-Puchta's user avatar
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 ...
Daniel Weber's user avatar
  • 3,319
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)$ ...
Joel Louwsma's user avatar
6 votes
0 answers
998 views

Generalized Courant-Fischer theorem

Consider some quaternionic matrix $A$. A right eigvenvalue of $A$ is a quaternion $q$ such that $Ax=xq$ for some $x\in \mathbb{H}^n$. Similarly, a left eigenvalue of $A$ is quaternion $q$ such that $...
hypercube's user avatar
  • 475
5 votes
2 answers
495 views

Existence of parametrizations of rational orthogonal matrices

I suppose that there are formulas which parametrize all the orthogonal matrices with rational coefficients. Does anyone know anything about it? And what are some publications that discuss this? Thanks....
jose luis leal's user avatar
5 votes
1 answer
474 views

An inequality for certain positive-semidefinite matrices

Suppose that $G=(G_{ij})$ is a positive-semidefinite symmetric matrix with the diagonal entries all equal $1$ and all off-diagonal entries $\le0$. Does it then necessarily follow that $$\sum_{i,j}(G^5)...
Iosif Pinelis's user avatar
5 votes
2 answers
250 views

Eigenvalue density of a symmetric tridiagonal matrix

Let $A_n\in\mathbb{R}^{n\times n}$ be defined as $$ A_n=\begin{bmatrix} a & b & 0 & \cdots & \cdots & 0 & 0\\ b & a & b & \cdots & \cdots & 0 & 0\\ 0 &...
Ludwig's user avatar
  • 2,712
5 votes
1 answer
103 views

Interpolation between two matrices so that $L^p$ norm is controlled

Assume to have two square matrices $A$ and $B$ acting on $\mathbb{R}^n$ such that all their entries are in the interval $[0,1]$ and such that $||Ax||_1 = ||x||_1$ and $||Bx||_\infty \leq ||x||_\infty$....
tommy1996q's user avatar
5 votes
1 answer
515 views

Do matrices with only elements along the main and anti-diagonals have a name?

To expand upon the title, I am wondering if there is a specific name for square matrices of the form: $$M = \begin{bmatrix} a_{11} & 0 & \cdots & 0 & \cdots & & 0 & b_{1n} ...
Victoria M's user avatar
5 votes
1 answer
141 views

On the half-skew-centrosymmetric Hadamard matrices

Definition 1: A Hadamard matrix is an $n\times n$ matrix $H$ whose entries are either $1$ or $-1$ and whose rows are mutually orthogonal. Definition 2: A matrix $A$ is half-skew-centrosymmetric if ...
user369335's user avatar
5 votes
1 answer
315 views

Rank-constrained least-squares solution of the Sylvester matrix equation

For the Sylvester matrix equation $AX+XB=C$, I want to find the least-squares solution $X$ via $$\begin{array}{ll} \text{minimize} & \| AX + XB - C \|_{\text{F}}^2\\ \text{subject to} & \mbox{...
dave2d's user avatar
  • 191
5 votes
1 answer
2k views

Rank of a 0-1-matrix

Suppose $K$ is a field of characteristic $0$. Let $M \in K^{n \times m}$ be a matrix such that every entry of $M$ is either $0$ or $1$. About this matrix, I know further that each sum over a column ...
Fabian Werner's user avatar
5 votes
1 answer
199 views

Find the inverse of a more general matrix that is similar to the Hilbert matrix

In the last MO question , the following matrix is given: $$M_{ij}=\left[\frac{1+(-1)^{i+j}}{i+j-1}\right]$$ and its inverse has been discussed. Now the problem is further extended to a more general ...
Dings's user avatar
  • 153
5 votes
2 answers
389 views

Pfaffian of several skew-linear transformations / matrices

Introduction: Let's assume we have a 2-form $\alpha=(1/2)\sum_{j,k=1}^n a_{jk}\ e_j\wedge e_k$, where $n=2m$, and $a_{jk}\in\mathbb C$. We know that $\alpha^{\wedge m}=\alpha\wedge\alpha\dots\wedge\...
BarTov's user avatar
  • 53
5 votes
0 answers
254 views

A weak Perron-Frobenius property for sets of positive matrices

A popular form of the Perron-Frobenius theorem states the following result: if $A$ is a $d \times d$ real matrix all of whose entries are positive, then the spectral radius of $A$ is a simple ...
Ian Morris's user avatar
  • 6,206
4 votes
2 answers
1k views

Reference request: Oldest linear algebra books with exercises?

Inspired by the recent success of my "soft question" here, I also have to ask, what are some of the oldest linear algebra books out there with exercises? I'm fine with or without solutions, either way....
4 votes
3 answers
369 views

Determinant in terms of certain $2\times 2$ minors

Let $A$ be an $n\times n$ matrix with entries $a_{i,j}$. Define an $(n-1)\times(n-1)$ matrix $B$ with entries $b_{i,j}=a_{1,1}a_{i+1,j+1}-a_{1,j+1}a_{i+1,1}$. Then $\det(B)=a_{1,1}^{n-2}\det(A)$. I ...
Joel Louwsma's user avatar
4 votes
1 answer
170 views

About $CW(512,16^2)$

Definitions: A weighing matrix $W = W(n,k)$ with weight $k$ is a square matrix of order $n$ and entries $w_{ij}$ in $\{0, \pm 1\}$ such that $WW^T=kI$, where $I$ is the identity matrix. A circulant ...
user369335's user avatar
4 votes
1 answer
414 views

A Handbook of Matrix Factorizations

I am looking for a good collection of facts regarding the various types of matrix factorizations, something like a "Handbook of Matrix Factorizations" or a very-thorough review paper. I am hoping for ...
Fixed Point's user avatar
4 votes
1 answer
1k views

Integer vectors in the kernel of an integer matrix

Let $A$ be a non-zero symmetric $n \times n$-matrix with integer entries and suppose that $\det(A) =0$. Question: How long is the shortest non-zero integer vector in the kernel of $A$? Example: If ...
Andreas Thom's user avatar
  • 25.5k