All Questions
6,289 questions
2
votes
1
answer
154
views
Is there an abstract theory of multi-spectral radii?
There seems to be many valid ways of generalizing the notion of the spectral radius $\rho(A)$ of a complex matrix $A$ to spectral radii of multiple operators. I am wondering if there is an abstract ...
2
votes
2
answers
382
views
Asymptotics of an integral requested
Given an integer $n\geq2$, consider the following integral
$$I_n:=\int_0^1nx^{n-1}\sqrt{\left\vert \frac{\log(1-x)}{\log n}\right\vert} \, dx.$$
QUESTION. Is this true? It appears to be so.
$$\lim_{n\...
6
votes
2
answers
503
views
Computing a limit on the unit sphere: Riemann Lebesgue?
Let $u\in L^1(\mathbb{S}^{d-1})$. I want to show that
\begin{align*}
\lim_{|\xi|\to \infty}
\int_{\mathbb{S}^{d-1}}(1-\cos(\xi\cdot w))u(w)d \sigma_{d-1}(w)
= \int_{\mathbb{S}^{d-1}}u(w)d \sigma_{d-1}(...
0
votes
0
answers
133
views
On nilpotent singular $\mathbb F_2^{n\times n}$ matrices
Let $M$ be a $0/1$ matrix over $\mathbb F_2^{n\times n}$ with determinant $0$.
The set of such singular matrices form a semigroup.
The set of nilpotent matrices of size $n\times n$ form a semigroup.
...
1
vote
1
answer
136
views
Matrix transformation that always works?
Consider the matrix
$$A_2:= \begin{pmatrix} a & b_1 \\ b_2 & a\end{pmatrix}.$$
Let $\sigma_2 = \begin{pmatrix} 0 & i \\ -i & 0 \end{pmatrix}$, then
$$\sigma_2 A_2 \sigma_2 = \begin{...
34
votes
3
answers
3k
views
Quickly determining if a matrix has any PSD completion
Given $m$ entries of an $n \times n$ matrix, is it possible to determine in $O(m n)$ time whether there is any positive semidefinite completion?
Slightly more precisely: for simplicity let's assume ...
0
votes
0
answers
177
views
Given optimality of L1 norm, prove that absolute value of sum of a vector with proper sign is less than 1?
Problem:
Given a domain $\mathcal{D}\subset\mathbb{R}^{l}$, we can find $l$
points $\boldsymbol{v}_{i}\in\mathcal{D}$, $i=1,\cdots,l$. Each
point is a column vector with dimension $l\times1$. They ...
6
votes
1
answer
368
views
Number of points on a linear algebraic group over a finite field
Let $G$ be a linear algebraic group defined over a finite field $\mathbb{F}_q$ as a variety of dimension $d$. What would be a good, simple lower bound for $G(F_q)$?
One can get something fairly nice ...
4
votes
1
answer
160
views
The boundedness of $L_1$ norm $\|(I+A)^{-1}\|_1$ if both $\|A\|_1$ and $\|A^{-1}\|_1$ are bounded
Assume that $A \in \mathbb{R}^{N \times N}$ is a positive semi-definite matrix, both $\|A\|_1$ and $\|A^{-1}\|_1$ are uniformly bounded as $N \to \infty.$ Here $\| \cdot \|_1$ is the induced $L_1$ ...
21
votes
2
answers
1k
views
Closed subspaces of Banach spaces
Is it true that, assuming the Axiom of Choice, every infinite-dimensional Banach space has an infinite-dimensional closed subspace with infinite codimension? Note that this is different from the ...
5
votes
0
answers
171
views
Maximal minors of tensor product
Let $r \leq n$ be integers, and let $A$ be an $r \times n$ integer-valued matrix such that each $r\times r$ minor of $A$ is in $\{0, 1,-1\}$. Is it true that each $r^2 \times r^2$ minor of $A\otimes A$...
1
vote
1
answer
404
views
Norm inequality
In an article I read, I have the following inequality:
$\|A-B\|_1 \geq \max \{ \|A 1_m- B 1_m \|_1, \|A^T 1_n - B^T1_n\|_1 \}$
Where $A, B \in \mathbb{R}_+^{m\times n}$.
The $\|\cdot\|_1$ refers ...
2
votes
0
answers
77
views
Equivalence of two descriptions of differentials of Koszul complex
My question comes from learning the paper [BGS96] Koszul duality patterns in representation theory by Beilinson, Ginzburg and Soergel, published in 1996.
Let $A=T_{A_0}A_1/\langle R\rangle$ be a ...
3
votes
0
answers
259
views
Efficient way to calculate Smith Normal Form of large integer matrices
I am interested in calculating the Smith Normal Form for Laplacian matrices of hypercube graphs. Using the elementary divisors method from SAGE, I was able calculate up to the 11-cube (which has a $2^{...
0
votes
0
answers
205
views
Prove that sum of eigenvalues of the inverse of an nxn correlation matrix A is greater than or equal to n
I stuck on this question and here is my thoughts:
So we have a nxn correlation matrix A with eigenvalues: λ_1,λ_2,...,λ_n
1.According to the property of correlation matrix, (λ_1)+(λ_2) + ... + (λ_n) = ...
1
vote
0
answers
138
views
Generalized eigenvalues of block matrix
Let $A, D \in \mathbb{R}^{n\times n}$ be symmetric matrices and consider the following matrix pencil
$$
\begin{pmatrix}
-I & A+\lambda I \\
A+\lambda I & -D \\
\end{pmatrix}
$$
If we already ...
2
votes
1
answer
152
views
Proof of Szegö asymptotic theorem
Consider the truncated exponential series
$$P_N(z) = \sum_{n= 0}^N \frac{z^n}{n!}$$
The zeros of this series have been studied by Szëgo and others (see e.g. here). He established an asymptotic for the ...
3
votes
0
answers
380
views
efficient numerical algorithm for matrix determinant
It appears that in numerical analysis the question of computing the determinant $\det A$ of a real or a complex $n\times n$ matrix $A$ is not well-studied, and a usual recommendation is to use matrix ...
2
votes
0
answers
185
views
Unimodular solutions of a system of linear equations
Suppose we have a homogeneous system of linear equations with complex coefficients:
$$
Az=0,
$$
$z = (z_1,z_2,\dots,z_n)^T \in \mathbb{C}^n$, matrix $A$ has size $m \times n$.
I'm interested in ...
0
votes
0
answers
44
views
Sufficient conditions to order the solutions to a system of linear equations
A pretty elementary question, but does anyone know of sufficient conditions to order the solutions of a system of linear equations? For example, in the system, \begin{align*}\begin{bmatrix}a_{11}&...
4
votes
0
answers
108
views
Doubly stochastic matrices that remain doubly stochastic after conjugating by the character table of a finite abelian group
I am curious if anything is known about the following.
Let $\Gamma$ be a finite abelian group, and let $\chi$ be its character table, normalized so that it is a unitary matrix. E.g., if $\Gamma$ is $\...
2
votes
0
answers
178
views
Can we get the exact solution of large-scale quadratic programming problems (quadratic objective, linear inequality constraints) using KKT condition?
Crossposted at Computational Science SE
Consider a quadratic programming problem with the following format:
$$
\text{min} Q(x) = c^Tx+\frac{1}{2}x^TDx \\
$$
$$
\text{s.t.} Ax\leq b, \\
x\geq 0
$$
...
8
votes
1
answer
412
views
Big triples in a matrix
Consider an $n\times n$ real matrix $A=(a_{ij})$ with non negative entries. Assume that
- the sum of the three largest entries in each row is a constant $R$ (the same for all rows),
- the sum of the ...
3
votes
0
answers
105
views
Techniques for solving linear inequalities
For $n$ real variables $x_1, \ldots, x_n$, I have a bunch of inequalities of form $2 x_i > x_j + x_k$ or $2 x_i < x_j + x_k$, where $i,j,k$ are distinct. My goal is to determine whether this set ...
0
votes
0
answers
172
views
A characterisation of full subgroups of $\mathrm{GL}_n(\mathbf{F}_p)$
Let $p\geq 5$ be a prime and $\mathbf{F}_p$ a finite field of characteristic $p$. A subgroup of ${\rm GL}_n(\mathbf{F}_p)$ is full if it contains ${\rm{SL}}_n(\mathbf{F}_p)$. When $n=2$, we have the ...
3
votes
0
answers
85
views
Exterior powers of the Cartan matrix and Dyck paths
(This question can be formulated purely combinatorially in terms of Dyck paths, which is done in the second part of the question. But I am more interested whether this can be explained by some sort of ...
18
votes
2
answers
488
views
Encoding primes via ranks of sign matrices
(Reposted from math.SE)
Recently I came across a very simply defined family of matrices: for $n \in \mathbb{N}$, set $A_n := (a_{ij})_{0 \le i, j \le n-1}$, where
$$\displaystyle a_{ij} := (-1)^{\big\...
2
votes
1
answer
223
views
Linearly independent vectors from a family of subspaces
For the proof of a certain combinatorial statement on subsets of ${\mathbb F}_2^n$
in a paper I and several other people are working on, the following statement was helpful.
Proposition.
Let $V$ be a ...
3
votes
0
answers
249
views
Grothendieck schemes and the Sheffer differential op calculus (Rota, Roman, et al. finite operator calculus)
In "Left differential operators on non-commutative algebras" on p. 4, Michiel Hazewinkel displays "precisely the right definition of differential operator" as
$$D\; X^n = F(\tfrac{...
1
vote
1
answer
184
views
Quantitative version of Lebesgue points theorem
Let $A \subset [0,1]^n$ with $A$ measurable and such that $\mathcal{L}^n (A)= \delta >0$, and consider a partition of $[0,1]^n$ in $\epsilon$-cubes (i.e. cubes of side $\epsilon)$. For $\epsilon \...
3
votes
1
answer
455
views
Approximating sum of entries of $\exp(A-B)$ for diagonal $A$ and rank-$1$ $B$?
I have non-negative $d\times d$ matrices $A$, $B$ and need a tractable way to compute the sum of all entries of $\exp(-t(A-B))$ where $A$ is diagonal and $B$ symmetric rank-$1$. IE
$$f(t)=\langle\exp(-...
1
vote
0
answers
70
views
If $\hat{D}$ minimizes trace over all $D+ B \succeq 0$, then is $\hat{D}_{ii} \leq \sum_{j} |B_{ij}|$ for each $i$?
Let $A$ be an $n \times n$ real matrix and let $B$ be the block bipartite matrix
$$B = \begin{bmatrix} 0&A \\
A^{T}&0 \end{bmatrix}$$
Let $\hat{D}$ be a solution to the SDP that minimizes $tr(...
2
votes
0
answers
266
views
Solutions to the quadratic matrix equation $X A X^T = B$
Let $A, B \in \mathbb{R}^{n \times n}$ be symmetric, positive-semidefinite, full-rank matrices. I would like to understand the set of $X \in \mathbb{R}^{n \times n}$ which are themselves symmetric and ...
1
vote
1
answer
338
views
distance between unitary and anti-unitary matrices
This question is related to the previous post, "A question about unitary and anti-unitary matrices". Following the suggestion of Lspice, I am posting it as a separate question, as it might ...
0
votes
1
answer
225
views
Faulty algorithm for simultaneous diagonalization?
I found a simple algorithm for simultaneous diagonalization of two commuting matrices (Nordgren - Simultaneous Diagonalization and SVD of Commuting Matrices), which seemed to be well-founded. For ...
1
vote
1
answer
123
views
Where is the maximum of the product of two logistic curves?
I've got an asymmetric peak-like function $y(x) = y_1(x)y_2(x)$,
where $y_1(x) = 1 / (1 + f_1(x)) = 1 / ( 1 + e^{( -r_1(x-x_1))})$ is an increasing logistic function
and $y_2(x) = 1 / (1 + f_2(x)) ...
1
vote
0
answers
115
views
Higher dimensional Cauchy interlacing theorem
If $A$ is a Hermitian matrix and $A_j$ the principal minor with the $j$ row and column deleted and $\phi_A(x)$ the characteristic polynomial. The Cauchy interlacing iheorem states that the roots of $\...
6
votes
0
answers
279
views
Estimating $E[\operatorname{Tr}(ABABBA..)]$ for random shuffling of $A,B$?
How can I estimate the following value where $A,B$ are $d\times d$ matrices and expectation is taken over all random permutations of the product?
$$E_\text{shuffle}[\operatorname{Tr}\underbrace{AA\...
1
vote
1
answer
579
views
Principal angles between subspaces and angle between unit vectors
Let $L_1$, $L_2$ be two subspaces in $\mathbb{R}^n$ and $\dim(L_1) = \dim(L_2) = s<n$. Let $$0 \leq \theta_1 \leq \dotsb\leq \theta_{s} \leq \pi/2$$ be the principal angles between $L_1, L_2$. Let ...
2
votes
2
answers
355
views
Sumset-distinct numbers
Let $x_1,\ldots,x_n$ be $n$ complex numbers, and define $x_I:=\sum_{i\in I}x_i$ for any set $I\subseteq[n]$. Finally, declare the family $(x_1,\ldots,x_n)$ to be "sumset-distinct" if the $2^...
3
votes
2
answers
176
views
Lower bound on the rank of a graph
[This has been edited in response to comments from Fedor Petrov]
Suppose that $n=dm$ with $d,m>1$. Consider an $n\times n$ matrix $M$ such that
All diagonal entries are equal to one
Each row has $...
2
votes
1
answer
100
views
Summation of rows of a matrix P^k is decreasing with the power k
I have the following $(n+1)\times (n+1)$ matrix
$$P = \begin{bmatrix}
f(0) & g(0) & 0 & 0 & 0 & \dots & 0\\
f(1) & 0 & g(1) & 0 & 0 & \dots & 0\\
f(2) &...
1
vote
0
answers
162
views
Number of full-rank binary matrices with given column Hamming weights [closed]
What is the number of $m \times n$ matrices over $\mbox{GF}(2)$ that share the following constraints :
They have full rank ($\mbox{rank} = m$, given that $m<n$).
Their columns have the given ...
0
votes
1
answer
143
views
Differential form of the multidimensional "orthogonal dilation" operator
For a one-dimensional $f(x)$, the dilation operator $f(ax)$ can be expressed as $\exp(g(D))f(x)$, where $g$ is a closed-form function. This is easily checked by e.g. formal Taylor series expansion.
...
0
votes
1
answer
115
views
Approximation for an expectation expression
Let $\mathbf{x} \in \mathbb{C}^M$ is an unknown distributed random vector (certainly not gaussian), and matrix $\mathbf{A}\in \mathbb{C}^{M \times M}$ which is fix (known). Also, assume we know the ...
1
vote
0
answers
122
views
How to make sense of $\mathrm{Mat}_q(n \times n)$? Are there notions of quantum vector space, quantum linear algebra, etc?
Given some algebra $\mathcal{A}$ and $q \in \mathbb{C}$, we say that a matrix $M \in \mathrm{Mat}(n \times n ; \mathcal{A})$ is a quantum matrix in $\mathrm{Mat}_q(n \times n)$ iff the following ...
1
vote
0
answers
77
views
Find a vector in the null space of a large dense matrix, where elements in the matrix are not directly accessible
I am working with Conjugate Gradient method to solve for 𝐴𝑥=𝑏, where 𝐴 is an extremely large PSD and Singular matrix. I cannot directly access the elements of 𝐴. The only thing I can do is ...
2
votes
1
answer
299
views
Eigenvalues of a specific matrix
I have a block matrix
$$M=\begin{bmatrix}
I_0& I_1& \cdots& I_1\\
I_2& I_0& \ddots& \vdots\\
\vdots& \ddots& \...
3
votes
1
answer
369
views
Linear system with sum of Kronecker products
Here and here, specific ways to address the equation in $x$, for $N=2$, are given:
$$\sum_{i=1}^N (A_i\otimes B_i)x=c$$
Is anything know about the case $N>2$?
I am looking in fact for an efficient ...
0
votes
0
answers
107
views
The eigenstructure of the symmetric tridiagonal matrix whose entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and $$a_{1,2}=\cdots=a_{n-1,n}=1$$
Suppose that $A=(a_{kl})_{k,l=1}^n$ is a symmetric tri-diagonal matix in $M_n(\mathbb{R})$ whose diagonal entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and
$$a_{1,2}=\cdots=a_{n-1,n}=1$$
Any approach to ...