All Questions
413 questions
91
votes
5
answers
124k
views
Eigenvalues of matrix sums
Is there a relationship between the eigenvalues of individual matrices and the eigenvalues of their sum? What about the special case when the matrices are Hermitian and positive definite?
I am ...
368
votes
31
answers
80k
views
Geometric interpretation of trace
This afternoon I was speaking with some graduate students in the department and we came to the following quandary;
Is there a geometric interpretation of the trace of a matrix?
This question ...
20
votes
6
answers
42k
views
Eigenvalues of symmetric tridiagonal matrices
Suppose I have the symmetric tridiagonal matrix:
$$ \begin{pmatrix}
a & b_{1} & 0 & ... & 0 \\\
b_{1} & a & b_{2} & \ddots & \vdots \\\
0 & b_{2} & a & \...
17
votes
0
answers
401
views
Number of $F_p$-matrices ac=ca, bd = db , ad - da = cb - bc is polynomial in p ? ("Manin matrix variety" - normal ? Cohen–Macaulay ? )
Consider four $n\times n$ matrices $a,b,c,d$ over finite field $F_q$ (or $F_p$ for simplicity), such that they satisfy three equations: $ac=ca,bd=db, ad-da=cb-bc $. Thus an affine algebraic manifold ...
42
votes
3
answers
5k
views
The probability for a symmetric matrix to be positive definite
Let me give a reasonable model for the question in the title. In ${\rm Sym}_n({\mathbb R})$, the positive definite matrices form a convex cone $S_n^+$. The probability I have in mind is the ratio $p_n=...
18
votes
3
answers
6k
views
Number of unique determinants for an NxN (0,1)-matrix
I'm interested in bounds for the number of unique determinants of NxN (0,1)-matrices. Obviously some of these matrices will be singular and therefore will trivially have zero determinant. While it ...
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. ...
24
votes
7
answers
16k
views
Expected determinant of a random NxN matrix
What is the expected value of the determinant over the uniform distribution of all possible 1-0 NxN matrices? What does this expected value tend to as the matrix size N approaches infinity?
15
votes
2
answers
836
views
What are the periodic Dyck paths?
I changed the thread completely so that everything is now elementary linear algebra.
A Dyck path of length $n$ is a list of positive integers $[c_1,c_2,...,c_n]$ with $c_i -1 \leq c_{i+1}$ for all $i$...
7
votes
1
answer
880
views
Bound for largest eigenvalue of symmetric matrices of uniform random variables over $[0,1]$ and fixed $1$s along diagonal and scattered $1$s
Given a $n\times n$ symmetric random matrix whose diagonal elements are all fixed as $1$. In addition, there are $k$ $1$s will be randomly scattered in upper triangular (of course, the corresponding ...
6
votes
3
answers
3k
views
functions with orthogonal Jacobian
I'm working on a model that would require to use vectorial functions of $\mathbb{R}^n \rightarrow \mathbb{R}^n$, such that $\forall x, y \in \mathbb{R}^n$, $\lVert \frac{df(x)}{dx}(y) \lVert_2 = \...
4
votes
5
answers
4k
views
About adding a negative definite rank-1 matrix to a symmetric matrix
If $B$ is a symmetric matrix then how do its eigenvalues compare to the eigenvalues of $B - vv^T$? ( where $v$ is a vector of the same dimension as $B$)
I guess that the eigenvalues of $B - vv^T$ ...
53
votes
7
answers
51k
views
Determinant of sum of positive definite matrices
Say $A$ and $B$ are symmetric, positive definite matrices. I've proved that
$$\det(A+B) \ge \det(A) + \det(B)$$
in the case that $A$ and $B$ are two dimensional. Is this true in general for $n$-...
28
votes
4
answers
5k
views
Jacobi's equality between complementary minors of inverse matrices
What's a quick way to prove the following fact about minors of an invertible matrix $A$ and its inverse?
Let $A[I,J]$ denote the submatrix of an $n \times n$ matrix $A$ obtained by keeping only the ...
20
votes
2
answers
1k
views
Euler numbers and permanent of matrices
Motivated by Question 402249 of Zhi-Wei Sun, I consider the permanent of matrices
$$e(n)=\mathrm{per}\left[\operatorname{sgn} \left(\tan\pi\frac{j+k}n \right)\right]_{1\le j,k\le n-1},$$
where $n$ is ...
20
votes
2
answers
8k
views
Conditions for smooth dependence of the eigenvalues and eigenvectors of a matrix on a set of parameters
Let $A\in\mathcal M_n$ be an $n\times n$ real [symmetric] matrix which depends smoothly on a [finite] set of parameters, $A=A(\xi_1,\ldots,\xi_k)$. We can view it as a smooth function $A:\mathbb R^k\...
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....
2
votes
1
answer
184
views
Count N-tuples of commuting matrices over $F_q$ is given by polynomials with pattern $\sum q^{A_i(N)} P_{i}(q) $, where $P_i$ - do not depend on $N$?
Count pairs of $k \times k$ commuting matrices over finite field $F_q$ is given by certain polynomials in $q$ (which is quite rare phenomena for algebraic varieties) and have interesting generating ...
128
votes
13
answers
27k
views
Should the formula for the inverse of a 2x2 matrix be obvious?
As every MO user knows, and can easily prove, the inverse of the matrix $\begin{pmatrix} a & b \\\ c & d \end{pmatrix}$ is $\dfrac{1}{ad - bc} \begin{pmatrix} d & -b \\ -c & a \end{...
28
votes
3
answers
2k
views
Is every positive integer the permanent of some 0-1 matrix?
In the course of discussing another MO question we realized that we did not know the answer to a more basic question, namely:
Is it true that for every positive integer $k$ there exists a balanced ...
22
votes
1
answer
4k
views
maximal order of elements in GL(n,p)
I am looking for a formula for the maximal order of an element in the group $\operatorname{GL}\left(n,p\right)$, where $ p$ is prime.
I recall seeing such a formula in a paper from the mid- or early ...
21
votes
3
answers
1k
views
Which doubly stochastic matrices can be written as products of pairwise averaging matrices?
A matrix $A$ is called doubly stochastic if its entries are nonnegative, and if all of its rows and columns add up to $1$. A subset of doubly stochastic matrices is the set of pairwise averaging ...
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 ...
17
votes
5
answers
2k
views
Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations?
This question is related to another question, but it is definitely not the same.
Is it always possible to diagonalize (at least locally around each point) a family of symmetric real matrices $A(t)$ ...
16
votes
5
answers
3k
views
Bounding the absolute sum of entries of the inverse of a 0-1 matrix
I have a non-singular square 0-1 matrix and I want to bound the sum of absolute values of its inverse as a function of n (or the vector 1-norm).
Asymptotic results are also useful.
Does anyone know ...
15
votes
3
answers
1k
views
Is this lower bound for a norm of some complex matrices true?
Let $A = [a_{ij}]_{n\times n}$ be a Hermitian matrix, such that $|a_{ij}| =1$ for $i \neq j$, and $a_{ii} = 0$ for each $i$.
I am interested in a tight lower bound of $\|A\|_*:=\sum_{i=1}^n |\lambda_i(...
15
votes
3
answers
2k
views
Distribution of the spectrum of large non-negative matrices
This question is related to that of Thurston. However, I am not interested in algebraic integers, and I wish to focus on random matrices instead of random polynomials.
When considering (entrywise) ...
14
votes
3
answers
780
views
Deciding if $\mathbb{Z}\ltimes_A \mathbb{Z}^5$ and $\mathbb{Z}\ltimes_B \mathbb{Z}^5$ are isomorphic or not
I asked this in this MSE question but I didn't get answers. I think maybe here someone can help me.
I have the two following groups
$G_A=\mathbb{Z}\ltimes_A \mathbb{Z}^5$, where $A=\begin{pmatrix} 1&...
13
votes
1
answer
745
views
A maximal element, where Schur gives a minimal element
Let me recall a result due to I. Schur, which I learnt from F. Goldberg's answer to my MO question Hadamard-like inequalites for positive definite symmetric matrices. If $H$ is a subgroup of $\frak ...
12
votes
2
answers
3k
views
Eigenvalues of nonnegative integer matrices
Edit
I realized that the key piece of information that I need is question 1, and so I'd like to rephrase this post:
What are the possible eigenvalues of nonnegative integer matrices?
Any answer to ...
12
votes
1
answer
5k
views
Closest 3D rotation matrix in the Frobenius norm sense
Given a 3 by 3 matrix $M$ I would like to find the rotation matrix $R$ minimizing the Frobenius norm:
\begin{equation}
\|R-M\|_F
\end{equation}
Is there a closed form solution for $R$, or is it ...
11
votes
1
answer
633
views
Determinant of a certain Vandermonde matrix
Is there a closed form expression for the determinant of the $n\times n$ Vandermonde-type matrix
$$A = \left(\begin{array}{}
1&g_1 & x_1&g_1 x_1 & x_1^2&g_1 x_1^2 & \cdots &...
11
votes
3
answers
6k
views
Random Sampling a linearly constrained region in n-dimensions...
Hi,
So here is my problem:
Given a nonlinear, discontinous, cost function $f(x_1,x_2,..,x_N)$ along with linear constraints $x_n \ge 0, \forall n$
$x_n \le c_n$
and $\sum_{n=1}^N x_n = 1$ find an ...
10
votes
1
answer
5k
views
Eigenvalues of the sum of a diagonal and a unit matrix
I'm trying to find information on the eigenvalues of an $n \times n$ matrix A such that
$A = D + J$
Where $D$ is some complex valued diagonal matrix, and $J$ is an matrix consisting of all $1$'s.
...
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 ...
7
votes
1
answer
6k
views
Eigenvectors as continuous functions of matrix - diagonal perturbations
The general question has been treated here, and the response was negative. My question is about more particular perturbations. The counterexamples given in the previous question have variations not ...
6
votes
6
answers
3k
views
Circumference of Convex Shapes
Here is a puzzle I found in Mitteilungen der DMV (roughly, "Letters of the German Society of Mathematicians"), issue 19/2011. It was posed by Alfred Schreiber in "Wie man Hasen fangt" (How to catch ...
6
votes
0
answers
514
views
concentration for eigenvectors
I am interested in bounding from above the ratio between the maximum and minimum entries of a Perron vector. The only results that I found in the literature are from the classic masters (Ostrowski and ...
6
votes
1
answer
777
views
Is every real matrix conjugate to a semi antisymmetric matrix?
Is it true to say that every matrix $A\in M_n(\mathbb{R})$ is similar (conjugate) to a matrix $B=(b_{ij})$ with $b_{ij}=-b_{ji}$ for all $i\neq j$?(With some abuse of terminology,a matrix $B$ with ...
3
votes
1
answer
327
views
LP Constraints for Connected Subgraphs of Fixed Size
Question:
how can the connectedness-constraint for a subgraph, that is induced by a proper subset $W\subset V$ of the vertices of $G(V,E),\ |V|=n,\ |W|=m$, be formulated in a $LP$ or $ILP$?
...
3
votes
2
answers
432
views
Maximum eigenvalue of a covariance matrix of Brownian motion
$$ A := \begin{pmatrix}
1 & \frac{1}{2} & \frac{1}{3} & \cdots & \frac{1}{n}\\
\frac{1}{2} & \frac{1}{2} & \frac{1}{3} & \cdots & \frac{1}{n}\\
\frac{1}{3} & \frac{...
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 ...
1
vote
1
answer
206
views
Factorizing the doubly stochastic matrix where all entries are equal such that the factors are all convex combinations of few permutation matrices
Let $N_{n}=(1/n)_{i=1,j=1}^{n}$ be the $n\times n$-matrix where all the entries are equal.
Suppose $n>0$. Let $\delta_{n}$ be the least natural number such that $N_{n}$ can be factored as $N_{n}=A_{...
81
votes
3
answers
9k
views
Norms of commutators
If an $n$ by $n$ complex matrix $A$ has trace zero, then it is a commutator, which means that there are $n$ by $n$ matrices $B$ and $C$ so that $A= BC-CB$. What is the order of the best constant $\...
58
votes
2
answers
18k
views
How fast can we *really* multiply matrices?
Background: The Strassen Algorithm, described here, has a computational complexity of $\text{O}(n^{2.807})$ for the multiplication of two $n \times n$ matrices (the exponent is $\frac{\log7}{\log2}$). ...
36
votes
8
answers
2k
views
Does the truth of any statement of real matrix algebra stabilize in sufficiently high dimensions?
This question is related to this recent but currently
unanswered MO
question
of Ricky Demer, where it arose as a comment.
Consider the structure $R^n$ consisting of $n\times n$
matrices over the ...
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$...
30
votes
4
answers
4k
views
Adjacency matrices of graphs
Motivated by the apparent lack of possible classification of integer matrices up to conjugation (see here) and by a question about possible complete graph invariants (see here), let me ask the ...
27
votes
5
answers
2k
views
Is the matrix $\left({2m\choose 2j-i}\right)_{i,j=1}^{2m-1}$ nonsingular?
Suppose we have a $(2m-1) \times (2m-1)$ matrix defined as follows:
$$\left({2m\choose 2j-i}\right)_{i,j=1}^{2m-1}.$$
For example, if $m=3$, the matrix is
$$\begin{pmatrix}6 & 20 & 6& 0 ...
26
votes
8
answers
4k
views
Euclidean volume of the unit ball of matrices under the matrix norm
The matrix norm for an $n$-by-$n$ matrix $A$ is defined as $$|A| := \max_{|x|=1} |Ax|$$ where the vector norm is the usual Euclidean one. This is also called the induced (matrix) norm, the operator ...