All Questions
608 questions
12
votes
5
answers
3k
views
How can I learn about doing linear algebra with trace diagrams?
There is a wikipedia article. There is a paper by Elisha Peterson. I tried reading these but they don't seem to click for me.
Are there books or other resources for learning how to do linear algebra ...
12
votes
1
answer
429
views
The scope of a "strong Cantor-Bernstein" property
This question is of course related to this earlier MO question, but I don't believe is answered by the posts there.
My favorite proof of the Cantor-Schroeder-Bernstein theorem actually establishes ...
12
votes
3
answers
4k
views
Status of Hadamard matrix conjecture
I would like to know if any progress has been made on Hadamard conjecture :
Hadamard matrix of order $4k$ exists for every positive integer $k$.
12
votes
2
answers
1k
views
Prove/disprove a linear algebra inequality
Setting:
Suppose $\{u_i\}_{i=1}^n \subset R^d$ is a collection of unit vectors such that $u_i^Tu_j < 0$ for all $i\neq j$, and $w$ is a unit vector such that $u_i^T w> 0$ for all $i=1,\dotsc,n$. ...
12
votes
3
answers
1k
views
Conjugacy in $GL(n,\mathbb Z)$
How can I determine whether $A_1,A_2\in GL(n,\mathbb Z)$ conjugate in $GL(n,\mathbb Z)$ and if they are, how can I find a $P\in GL(n,\mathbb Z)$ for which $A_2 = P^{-1}.A_1.P$ ?
In $GL(n,\mathbb Q)$ ...
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
3k
views
Best way to find a closest vector in a lattice
Let $v_1,\dotsc,v_n$ be linearly independent vectors in $\mathbb{R}^n$, and let $\Lambda=\bigoplus_{i=1}^n \mathbb{Z}v_i$. The question is, given a vector $w$ in $\mathbb R^n$, find the element $v$ ...
11
votes
1
answer
838
views
Are these abelian groups free?
Suppose we have a countable, torsion-free abelian group $A$ with the property that for each element $a\neq 0$ the set $D_a=\{x\in A|\exists n\in \mathbb{Z}:nx=a\}$ is finite.
Is $A$ already a free ...
11
votes
1
answer
453
views
A variant of Cholesky decomposition involving binary matrices
Studying a problem that is not directly related to linear algebra I came across the following problem.
Let $B$ be $n \times n$ symmetric matrix whose entries are non-negative integers. I would like ...
11
votes
2
answers
2k
views
Inverse of a small submatrix
Let $A$ be a large matrix (say, $1000 \times 1000$), and let $\mathcal I = \{2,3,5\}$ be a set of row/column indices. Let $(A^{-1})_{\cal I \times I}$ denote the submatrix of $A^{-1}$ that consists of ...
11
votes
2
answers
3k
views
Do singular values dominate eigenvalues?
Suppose $A$ is an $n \times n$ complex matrix with singular values $s_1 \ge s_2 \ge \cdots \ge s_n$ and eigenvalues $(\lambda_i)_{i=1}^{n}$ arranged so that $|\lambda_1| \ge |\lambda_2| \ge \cdots \...
11
votes
1
answer
315
views
Further aspects of a Hankel matrix of involution numbers
We have two conjectured generalizations of the question asked at
a Hankel matrix of involution numbers
by Tewodros Amdeberhan. Let $n!!=1!\,2!\cdots n!$.
Conjecture 1. Let $I_k$ denote the number of ...
11
votes
3
answers
1k
views
Diagonalization via the Toda flow
According to some almost indecipherable notes of a graduate Linear Algebra class, a symmetric matrix $A\in\mathbb R^{n\times n}$ can be diagonalised via the Toda flow. More specifically, if $X=X(t)\in\...
11
votes
1
answer
4k
views
Singular value decomposition over finite fields?
What is the definition of a singular value over a finite field $\mathcal{F}$ of a matrix ${\bf A}$ in $\mathcal{F}^{m\times n}$? Is there a geometric intuition in the same manner as with the real case ...
11
votes
1
answer
792
views
Axiom of choice and algebraic tensor product
The first part of the question was asked on Math-stackexchange.
Let $V$, and $W$ be vector spaces. By the universal property of the tensor product,
there is a canonical map from $V^*\otimes W^*$ ...
11
votes
4
answers
5k
views
Maximum determinant of $\{0,1\}$-valued $n\times n$-matrices
What's the maximum determinant of $\{0,1\}$ matrices in $M(n,\mathbb{R})$?
If there's no exact formula what are the nearest upper and lower bounds do you know?
11
votes
2
answers
1k
views
A binomial determinant fomula
Is there an existing or elementary proof of the determinant identity
$
\det_{1\le i,j\le n}\left( \binom{i}{2j}+ \binom{-i}{2j}\right)=1
$?
11
votes
2
answers
353
views
Exponential decay of voltage potential difference
Consider the following adjacency matrix of a complete graph:
$$A=(e^{-|i-j|})_{1\leq i\neq j\leq n}$$
with 0 on the diagonal. Let $D=diag\{d_1,...,d_n\}$ be the degree matrix where $d_i=\sum_{j\neq i}...
11
votes
1
answer
1k
views
Show that these vectors are linearly independent almost surely
So I'm doing research in control theory and I have been stuck with this problem for a while. Let me explain my issue, then my proposal, and finally my concrete question.
Problem: I have $m<n$ real $...
10
votes
2
answers
3k
views
How do you tell if a system of linear inequalities has a solution?
A naive solution would be to optimize a dummy variable via linear programming and see if a result is returned. I imagine there must be a more direct way.
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 $...
10
votes
1
answer
3k
views
Reverse Minkowski (and related) Determinant Inequalities
For positive semidefinite matrices $A,B,C \in \mathbb{R}^{n\times n}$, the following inequalities are well known:
$$(\det(A+B))^{1/n} \geq (\det A)^{1/n} + (\det B)^{1/n} $$
and
$$\det(A+B+C) + \...
10
votes
1
answer
4k
views
Properties of Zero Line-Sum Matrices
By a Zero Line-Sum (ZLS) matrix I mean matrices with the property, that each row sum and each column sum equals zero:
$$A\in\mathbb{R}^{m\times n}:\ \sum_{i=1}^{n}a_{ij}=\sum_{j=1}^{m}a_{ij}=0$$
...
10
votes
1
answer
449
views
How to compute $\sum_{x \in \mathbb{Z}^n} e^{-x^TMx}$ efficiently
Let $M$ be a real symmetric integer valued positive definite matrix with $\det(M) \geq 1$. I would like write code to compute
$$S_M= \sum_{x \in \mathbb{Z}^n} e^{-x^TMx}.$$
One option is to simply ...
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 ...
10
votes
2
answers
18k
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 available,...
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,
$$...
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
2
answers
5k
views
Nuclear norm as minimum of Frobenius norm product
Nuclear, or trace, or Ky Fan, norm of a matrix is defined as the sum of the singular values of the matrix.
It is claimed that
$$
\|X\|_\sigma = \min_{UV^T=X} \|U\|\|V\| = \min_{UV^T=X} \frac{1}{2}(\|...
10
votes
2
answers
1k
views
Probability of random (0,1) Toeplitz matrix being invertible
A Toeplitz matrix or diagonal-constant matrix is a matrix in which each descending diagonal from left to right is constant.
What is the probability that a random $n \times n$ binary Toeplitz ...
10
votes
3
answers
2k
views
Is $Sym^n (V^*) \cong Sym^n (V)^\ast$ naturally in positive characteristic?
Background/motivation
It is a classical fact that we have a natural isomorphism $Sym^n (V^*) \cong Sym^n (V) ^\ast$ for vector spaces $V$ over a field $k$ of characteristic 0. One way to see this is ...
10
votes
2
answers
2k
views
Largest rank submatrix of a skew symmetric matrix
Is the following statement true?
Given a skew symmetric matrix M, among all of its largest rank sub-matrix, there must be one that is the principal submatrix of M.
10
votes
1
answer
366
views
Powers of traces, integrals over spheres and class functions
I asked this on math.StackExchange a while back but got no answers. I hope I'll be forgiven for the double post.
Let $V$ be a complex vector space of dimension $\operatorname{dim}_{\mathbb C} V = n$, ...
10
votes
0
answers
420
views
Gram matrix determinant in dimension 4 and $E_8$
Consider a determinant of a Gram matrix in dimension $4$.
$$\begin{vmatrix}
1 & -\cos(\alpha_1) & -\cos(\alpha_2) & -\cos(\alpha_3)\\
-\cos(\alpha_1) & 1 & -\cos(\alpha_6)& -\...
10
votes
0
answers
229
views
Maximum dimension of a space of $n\times n$ real matrices with at least $k$ nonzero eigenvalues
Let $M_n(\mathbb{R})$ denote the $n^2$-dimensional real vector space
of real $n\times n$ matrices. Let $\rho_k(n)$ denote the maximum
dimension of a subspace $V$ of $M_n(\mathbb{R})$ such that every
...
10
votes
2
answers
4k
views
Perturbation theory for the generalized eigenvalue problem
Is there a standard reference for the perturbation theory of the generalized eigenvalue problem?
More specifically, I would like to get a systematic expansion for the problem
$(A_0 + \epsilon A_1)...
10
votes
2
answers
985
views
Determinantal symmetry: proof requested: Part I
Consider the determinantal function
$$F(a,b,c):=\det\left[\binom{i+j+a+b}{i+a}\right]_{i,j=0}^{c-1}.$$
I would like to ask:
QUESTION. Can you provide an argument, combinatorial or otherwise, to ...
10
votes
1
answer
630
views
Minimum distance of a symmetric matrix to diagonal matrices
Let $A=(a_{ij})$ be an arbitrary $n \times n$ real symmetric matrix and $n\geq 2$. Let $\| \cdot \|$ denote the operator $2$-norm or equivalently the maximum absolute value of eigenvalues for ...
10
votes
1
answer
466
views
Is there a pattern for the irreducible factors and degrees of a characteristic polynomial?
Let $Log(n) = \sum_{i=1}^r \alpha_i \cdot e_i$, where $n = \prod_{i=1}^r p_i^{\alpha_i}$ and $p_i$ is the $i$-th prime, $\alpha_i \ge 0$, $e_i$ is the $i$-th standard basis vector. For example $6 = 2\...
9
votes
3
answers
696
views
I want to find a smooth section of the map from the Stiefel manifold to the Grassmanian manifold
The following question is related to research I am doing on reinforcement learning on manifolds.
I have a set of basis vectors $\boldsymbol{B} = \{\boldsymbol{b}_1,\dots,\boldsymbol{b}_k\}$ that span ...
9
votes
2
answers
2k
views
Classification of adjoint orbits for orthogonal and symplectic Lie algebras?
This might be standard, but I have not seen it before:
Let $K$ be an algebraically closed field (of characteristic 0 if necessary). Let $G$ be the orthogonal group ${\bf O}(m)$ or the symplectic ...
9
votes
1
answer
3k
views
Frobenius-Perron eigenvalue and eigenvector of sum of two matrices
Suppose that I have two positive matrices, $A$, and $B$, and I know their Frobenius-Perron eigenvalues ($\lambda_A$, $\lambda_B$) and eigenvectors ($v_A$, $v_B$). I'm interested in what I can say ...
9
votes
4
answers
1k
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 ...
9
votes
1
answer
1k
views
0 eigenvalue for a symmetric tridiagonal matrix
Let $T\in \mathbb{R}^{n\times n}$ be a symmetric tridiagonal matrix having the off--diagonal entries equal to -1. The diagonal entries are all positive, $a_i>0$, $i=\overline{1,n}$, and there ...
9
votes
1
answer
384
views
Smith Normal Form of a Cayley Graph of the Symmetric Group
Let $A_n$ be the adjacency matrix of the Cayley graph $\text{Cay}(S_n,C_n)$ where $C_n \subseteq S_n$ is the conjugacy class of $n$-cycles of the symmetric group $S_n$. Since the generating set of ...
9
votes
2
answers
2k
views
Almost orthogonal vectors in subsets of euclidean space
Given the vector space $\mathbb{R}^n$, endowed with the standard inner (dot) product $\langle\cdot,\cdot\rangle:\mathbb{R}^n\times \mathbb{R}^n\to\mathbb{R}$, the problem of almost-orthogonal sets ...
9
votes
0
answers
1k
views
coordinate-free proof of transitivity of norms or traces
Hello:
Suppose $A$ is a finite free $B$-algebra and $B$ is a finite free $C$-algebra. Does anyone
know a coordinate-free proof (i.e. without choosing bases) of the identity:
$N_{A/C} = N_{B/C}\circ ...
9
votes
1
answer
1k
views
How to write down the determinant of a quasi-isomorphism?
This question about the determinant of a perfect complex reminded me of an old question that I had.
The construction of the determinant (as in MR1914072 or MR0437541) is a difficult piece of ...
9
votes
3
answers
2k
views
On similar matrices and polynomial matrices
I'm teaching linear algebra and I'm encountering this theorem:
two matrices $A$ and B are similar iff $tI - A$ and $tI - B$ are equivalent (as polynomial matrices), where $I$ is the unit matrix.
The ...
9
votes
3
answers
2k
views
How to calculate inverse of sum of two Kronecker products with specific form efficiently?
I have a matrix with specific form of $A\otimes I + B\otimes J$ where $A$ and $B$ are general dense matrices, $n\times n$. $I$ is an $m\times m$ identity matrix. $J$ is a $m \times m$ dense matrix ...