Questions where the notion matrix has an important or crucial role (for the latter, note the tag matrix-theory for potential use). Matrices appear in various parts of mathematics, and this tag is typically combined with other tags to make the general subject clear, such as an appropriate top-level ...

learn more… | top users | synonyms (1)

23
votes
4answers
28k 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 they are Hermitian and positive-definite? I am investigating ...
154
votes
21answers
22k views

Geometric Interpretation of Trace

This afternoon I was speaking with some graduate students in the department and we came to the following quandry; Is there a geometric interpretation of the trace of a matrix? This question ...
29
votes
2answers
2k 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 ...
25
votes
4answers
2k 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 ...
12
votes
3answers
3k 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 won't have a determinant. While it might also be ...
11
votes
5answers
986 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)$ ...
10
votes
2answers
3k 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 ...
13
votes
7answers
6k 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?
8
votes
2answers
528 views

Is this a metric on the Grassmannian Manifold?

Let $m>n$ and consider the Set $$S_{m,n}=\{A \in \mathbb{R}^{m \times n}\lvert A^TA=I_n \}.$$ Does the function $d\colon S_{m,n} \times S_{m,n} \rightarrow \mathbb{R}$ defined by ...
19
votes
4answers
966 views

Does Anyone Know Anything about the Determinant and/or Inverse of this Matrix?

The matrix I am inquiring about here is the $n \times n$ matrix where the entry $A_{ij}$ is $\frac{1}{(i+j-1)^2}$. The $2 \times 2$ matrix looks like $$ \begin{pmatrix} 1 & 1/4 \\ 1/4 & 1/9 ...
14
votes
4answers
879 views

Eigenvectors of a particular transition matrix

I am considering a Markov chain with $n$ states with a particularly nice structure. The transition matrix is as follows: \begin{equation}\mathbf{P}=\begin{pmatrix} 0 & 0& \dots&0 & 0 ...
10
votes
5answers
1k 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 ...
5
votes
0answers
247 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 ...
9
votes
1answer
345 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
1answer
748 views

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

Is there any known formula for the number of idempotent $n\times n$ matrices over $\mathbb{Z}_m$ ? The number of idempotent matrices over a finite field is well-known and since we can decompose $m$ ...
1
vote
5answers
258 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$ ...
8
votes
2answers
1k 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 ...
3
votes
1answer
191 views

Reference for partial Hadamard matrices

Definition. An $m\times n$ matrix is said to be a partial Hadamard matrix (let's say PHM) if its entries are chosen from $\lbrace -1, 1 \rbrace$ such that the dot product of each pair of row vectors ...
1
vote
0answers
372 views

Possibility of Disconnected Subgraphs of a $k$ Connected $r$ regular Graph under a given condition

Context: Given a adjacency matrix A of a $r$-regular graph $G$ (not complete graph $K_{r+1}$) . $G$ is $k$ connected. The matrix A can be divided into 4 sub-matrices based on adjacency of vertex $x ...
1
vote
1answer
188 views

A geometric property of singular matrices

Let $S\subset M_{n}(\mathbb{R})$ be the singular points of the equation $Det=0$. That is $S$ is the critical points of the determinant function. What matrices belongs to $S$, precisely? Let ...
64
votes
2answers
4k 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 ...
48
votes
7answers
3k views

How to prove this determinant is positive?

Given the matrices $ A_i= \biggl(\begin{matrix} 0 & B_i \\ B_i^T & 0 \end{matrix} \biggr) $, where $B_i$ are real matrices and $i=1,2,\ldots,N$, how to prove that $\det(I + ...
30
votes
3answers
2k views

A curious determinantal inequality

In my study, I come across the following curious inequality, which I do not know a proof yet (so I am asking it here). Let $A, B$ be $n\times n$ (Hermitian) positive definite matrices. It is very ...
18
votes
4answers
2k views

Condition for two matrices to share at least one eigenvector?

Suppose that I have two matrices $A$ and $B$, and I want them to share a common eigenvector $x$. For simplicity let's just assume that the eigenvalue associated with $x$ is $1$ for both matrices, so ...
13
votes
3answers
1k 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) ...
11
votes
3answers
2k views

Diagonalizing a Certain Real and Symmetric Toeplitz Matrix

Consider $0\leq \alpha\leq 1$, and let $A_{\alpha}$ be the Toeplitz $n\times n$ matrix given by $$ A_\alpha := \begin{bmatrix} 1 & \alpha & \alpha^2 & \ldots &\alpha^{n-1} \\\ \alpha ...
12
votes
3answers
479 views

The conjugacy classes of diagonalizable $2 \times 2$ matrices can be identified with their eigenvalues, what about pairs?

For sake of simplicity, let's say that we live in $G = SL(2, \mathbb{C})$. Every conjugacy class of diagonalizable matrices $$[A] := \{gAg^{-1} \mid g \in G\}$$ can be identified with its set of ...
27
votes
7answers
1k 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 ...
18
votes
3answers
920 views

looking for proof or partial proof of determinant conjecture

Math people: I am looking for a proof of a conjecture I made. I need to give two definitions. For distinct real numbers $x_1, x_2, \ldots, x_k$, define $\sigma(x_1, x_2, \ldots, x_k) =1$ if $(x_1, ...
8
votes
4answers
3k views

Eigenvectors and eigenvalues of Tridiagonal matrix

Hi, is it possible to analytically evaluate the eigenvectors and the eigenvalues of a tridiagonal matrix of the form : $$ \mathcal{T}^{a}_n(p,q) = \begin{pmatrix} 0 & q & 0 & 0 ...
15
votes
4answers
998 views

Are almost commuting hermitian matrices close to commuting matrices (in the 2-norm)?

I consider on $M_n(\mathbb C)$ the normalized $2$-norm, i.e. the norm given by $\|A\|_2 = \sqrt{Tr(A^* A)/n}$. My question is whether a $k$-uple of hermitian matrices that are almost commuting (with ...
9
votes
1answer
1k views

Arithmetic-geometric mean of positive matrices

Let $A,B$ be positive definite (Hermitian) matrices. Define the Arithmetic-geometric means of positive matrices by $A_0=A, G_0=B$, $A_{n+1}=\frac{A_n+G_n}{2}, G_{n+1}=A_n\natural G_n$, where ...
8
votes
2answers
5k views

Fast trace of inverse of a square matrix

Which would be the most efficient way (in computational time) to compute tr(inv(H)), where H is a (dense) square matrix? In my particular problem I also have a LU decomposition of H already ...
7
votes
3answers
1k views

2-norm of the upper triangular “all-ones” matrix

Let $M_n$ be the $n\times n$ matrix $$ (M_n)_{ij}=\begin{cases}1 & i\leq j,\\\\ 0 &i>j.\end{cases} $$ Is there around an explicit expression or at least an asymptotic for $\left\Vert M_n ...
17
votes
1answer
368 views

A possible extension of a determinant inequality

It is well known that if $A, B$ are positive semidefinite matrices, then $$\det (A+B)\ge \det A+\det B.$$ I am considering a possible extension of this result. Let $\mathbb{M}_m(\mathbb{M}_n)$ ...
17
votes
6answers
2k views

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

I asked this (with background) here http://stats.stackexchange.com/questions/38494/principal-component-analysis-bootstrap-and-probability-of-eigenvalue-collision but did not really get any answers. ...
9
votes
3answers
478 views

Product of a Finite Number of Matrices Related to Roots of Unity

Does anyone have an idea how to prove the following identity? $$ \mathop{\mathrm{Tr}}\left(\prod_{j=0}^{n-1}\begin{pmatrix} x^{-2j} & -x^{2j+1} \\ 1 & 0 \end{pmatrix}\right)= \begin{cases} ...
9
votes
4answers
1k 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 ...
9
votes
3answers
1k views

Concavity of $\det^{1/n}$ over $HPD_n$.

One of my beloved theorems in matrix analysis is the fact that the map $H\mapsto (\det H)^{1/n}$, defined over the convex cone $HPD_n$ of Hermitian positive definite matrices, is concave. This is ...
8
votes
0answers
417 views

Eigenvalues of permutations of a real matrix: how complex can they be?

This is sort of complementary to this thread. I’ll repeat the definitions here: For a matrix $M\in GL(n,\mathbb R)$, consider the $n!$ matrices obtained by permutations of the rows (say) of $M$ and ...
13
votes
1answer
588 views

Free subgroups of GL(2,Z)

Is there a bound $B$ such that every 2-generator subgroup $G = \langle a, b \rangle < {\rm GL}(2,\mathbb{Z})$ whose generators do not satisfy a relation of length $\leq B$ is free? If it exists, ...
12
votes
1answer
834 views

How can we interpret the eigenvalues and eigenvectors of Euclidean Distance Matrices?

I asked this question in Math Stack Exchange earlier here: http://math.stackexchange.com/questions/1199380/what-is-the-intuition-behind-how-can-we-interpret-the-eigenvalues-and-eigenvec and since I ...
12
votes
0answers
545 views

Is “being a full ring of quotients” a Morita invariant property?

Definition and context: An (associative, unital, not necessarily commutative) ring $R$ is called classical if every regular element of $R$ is a unit. Equivalently, $R$ is its own classical ring of ...
9
votes
4answers
843 views

Elements of finite order of $\mathrm{PGL}(n,\mathbb{Q})$

For some research work, I need to know the classification of elements of finite order of $\mathrm{PGL}(n,\mathbb{Q})$, up to conjugation. Since I essentially need $n\le 4$, I think that I can show it ...
8
votes
3answers
6k views

How to solve this quadratic matrix equation?

I would like to solve for $X$ in the matrix equation $$ XCX + AX = I $$ where all the matrices are $n\times n$, have real components, $X$ is positive semidefinite and $C$ is symmetric. My (possibly ...
7
votes
2answers
285 views

Covering the zeros of 0/1 matrix with submatrices

The matrices I am dealing with are $n\times n$ of the following type (with $n=7$): $M_7=\begin{pmatrix}1&0&0&0&0&0&1 \\ 1&1&0&0&0&0&0 \\ ...
6
votes
2answers
202 views

Is a normal matrix satisfying $A^TA=…$ circulant?

Let $A=\{a_{ij}\}$ be a normal matrix such that $a_{ij}\geq 0$ with equality iff $i=j$. Suppose that $$ A^TA=\begin{pmatrix} a & b & \cdots & b\\ b & a & \ddots & \vdots\\ ...
5
votes
1answer
720 views

Proving that the kernel of this matrix is of dimension 2

(Edit : see at the bottom of the question for an additional surprising possible hint.) Using a computational software program, I found that the kernel of the following matrix is of dimension 2 when ...
3
votes
1answer
785 views

Ratio sum comparison on operators

It is known by the Lidskii inequality, that $\sum_{i=1}^n \left|s_i(S)-s_i(T)\right|\le\sum_{i=1}^n s_i(S+T)$, where $s_i(S)$ is the $i$-th singular value of $S$. How would one prove that ...
3
votes
2answers
334 views

Invariants on matrices

Take all the $n\times n$ matrices of 0's and 1's and define an equivallence relation as follows: Two matrices are equal if there is a way to pass from the one to another by alternating the columns and ...