All Questions
Tagged with matrices reference-request
29 questions
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. ...
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....
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$...
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 ...
14
votes
1
answer
544
views
Are there nice isomorphisms $\operatorname{S}^2(k^n)\cong\Lambda^2(k^{n+1})$?
This might be forced to migrate to math.SE but let me still risk it.
The spaces $\operatorname{S}^2(k^n)$ and $\Lambda^2(k^{n+1})$ from the title have equal dimensions. Is there a natural isomorphism ...
11
votes
1
answer
946
views
Detailed modern references for basic properties of Pfaffians over commutative rings
Pfaffians are important to algebraic combinatorics, at least.
This is to propose the making of a 'wiki' list, more modern, precise and compressed than e.g. the relevant Wikipedia page (nothing against ...
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 $...
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-...
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 ...
13
votes
2
answers
414
views
Is every finite-order unimodular matrix conjugate to a $0,1,-1$ matrix?
Problem. Given a matrix $A\in\mathrm{GL}(n,\mathbb{Z})$ such that $A^k=1$ for some $k\geq 1$, is there a matrix $g\in\mathrm{GL}(n,\mathbb{Z})$ such that $gAg^{-1}$ has only $0$, $1$, and $-1$ as ...
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 &...
11
votes
1
answer
467
views
Correspondence between matrix multiplication and a graph operation of Lovász
In his book "Large networks and graph limits", Lovász describes a multiplication operation (he calls it concatenation) on "bi-labeled graphs". An $(m,n)$ bi-labeled graph is a ...
10
votes
3
answers
829
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,
$$...
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,...
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 $...
8
votes
1
answer
441
views
A question on symmetric matrices
$\newcommand{\R}{\mathbb{R}}$
The question is
Is there a constructive (say, parametric) description of the set (say $M_n$) of all symmetric matrices $A\in\R^{n\times n}$ such that all the diagonal ...
7
votes
1
answer
223
views
Result attribution for eigenvalues of a matrix of Pascal-type
A few years ago, I wanted to cite a result in a paper, for which I could not find a reference. I ended up not using the full strength of it, and the part that I needed could be easily proved. Still, I'...
7
votes
0
answers
133
views
Removing rows to reduce the rank
What is the smallest number of rows one can delete from a matrix to reduce its rank (by $1$)? Is there any standard name / notation for this characteristic? Has it been studied?
I am in fact ...
7
votes
1
answer
169
views
What is the maximal possible rank of a subgroup of a special linear group mod a prime?
Let $p$ be a prime number, and let $\mathbb{F}_p$ be the unique field of cardinality $p$.
What is $\max \{d(H) : H \leq \mathrm{SL}_3(\mathbb{F}_p)\}$?
Here we denote by $d(G)$ the smallest ...
7
votes
2
answers
1k
views
Dimension of the nilpotent centralizer of a nilpotent matrix
Fix a natural number $n$ and an algebraically closed field $k$. Let $\mathfrak{g}=\mathfrak{gl}_n(k)$. For any partition of $n$, $\lambda=(\lambda_1,\ldots,\lambda_r)$, let $A_{\lambda}$ be the $n\...
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)...
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 ...
4
votes
0
answers
188
views
Distributions over permutation groups $\mathcal{S}_n$
Partly inspired by recent developments in enumeration of pattern avoiding permutations, which is known to be connected with Brownian excursions [Hoffman&Rizzolo]. The exciting milestone is the ...
4
votes
1
answer
781
views
Determinant of a random row stochastic matrix
Does anyone know anything about the determinant of a random $n\times n$ row stochastic matrix? What I have in mind is that the rows are independently selected from the uniform distribution on the unit ...
3
votes
1
answer
166
views
The spectral radius of a modified graph
Let $H$ be a graph and let $G=H \vee K_{1}$ be obtained by creating a new vertex and joining it to every vertex in $H$.
This situation has many different names: $G$ is called the cone or the ...
3
votes
1
answer
655
views
Upper bounds on the condition number of the eigenvector matrix
Let $A$ be an $n\times n$ real matrix with entries in a fixed interval $[a_\min,a_\max]$, with $a_\min$, $a_\max>0$.
Question: Are there any upper bounds on the condition number of the ...
2
votes
1
answer
325
views
Determinant and inverse of a "stars and stripes" matrix
This is a variant of another MO question. Consider the matrix
$$M_n:=\begin{bmatrix}c_1& a & b&a& \ddots & a \\ b & c_2 & a& b&\ddots & b\\ a & b & c_3&...
2
votes
1
answer
417
views
Roots of determinant of matrix with polynomial entries
Let $p_1, p_2,\dots, p_n$ and $q_1,q_2,\dots,q_n$ be a collection of complex polynomials. Let $A$ be a $n \times n$ matrix satisfying
$$a_{ij} = \begin{cases} p_i(x) & \text{ if } i = j, \\ q_i(x)...
2
votes
1
answer
741
views
rank of a linear combination of matrices
Let $A_1,..., A_s \in M_n(\mathbb{R})$ be symmetric matrices and suppose they are linearly independent over $\mathbb{R}$. This means that
$$
m = \min_{(c_1, ..., c_s) \in \mathbb{R}^s \backslash \{0\}}...