Skip to main content

All Questions

Filter by
Sorted by
Tagged with
23 votes
4 answers
2k 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{\mathrm{Tr}(A^* A)/n}$. My question is whether a $k$-uple of hermitian matrices that are almost ...
Mikael de la Salle's user avatar
20 votes
3 answers
1k views

Simultaneous "orthonormalization" in $\mathbb{C}^4$

Let $A$ be a positive, invertible $4 \times 4$ hermitian complex matrix. So we have a positive sesquilinear form $\langle Av,w\rangle$. Say that a pair $(v,w)$ of vectors in $\mathbb{C}^4$ is good ...
Nik Weaver's user avatar
  • 42.8k
19 votes
2 answers
2k views

Is the tensor product of polyhedra a polyhedron?

Conventions: A polytope in a finite-dimensional $\mathbb R$-vector space $V$ is defined to be a convex hull of finitely many points in $V$. A polyhedron in a finite-dimensional $\mathbb R$-vector ...
darij grinberg's user avatar
17 votes
3 answers
2k views

The minimum of a sum of absolute values of inner products in $\mathbb{R}^d$

Consider a collection of unit vectors $v_1, \ldots, v_n$ in $\mathbb{R}^d$ (we think of $n$ being much larger than $d$). I would like to minimize the sum: $$\sum_{i\neq j}|\langle v_i,v_j\rangle|.$$ ...
TOM's user avatar
  • 2,288
16 votes
0 answers
860 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 ...
Torsten Schoeneberg's user avatar
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 ...
Vagabond's user avatar
  • 1,795
15 votes
0 answers
446 views

The rank of a "triangle-free" matrix

This is a version of the question I asked recently, but the assumptions got now strengthened substantially. Suppose that $A=(a_{ij})_{1\le i,j\le n}$ is a square matrix with all elements in $\{0,\...
Seva's user avatar
  • 23k
15 votes
3 answers
24k 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 ...
Mike Izbicki's user avatar
14 votes
5 answers
989 views

Eigenvalues of a matrix with entries involving combinatorics

Let $F(n, l, i, j)$ be the cardinality of the set \begin{eqnarray*} \{(k_1, \cdots, k_n)\in\mathbb{Z}^{\oplus n}|0\leq k_r\leq l-1\text{ for }1\leq r\leq n\text{, }k_1+\cdots+k_n=lj-i\}. \end{eqnarray*...
No_way's user avatar
  • 383
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 ...
მამუკა ჯიბლაძე's user avatar
14 votes
4 answers
3k 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 &...
MthQ's user avatar
  • 41
13 votes
3 answers
1k views

Are the trace relations among matrices generated by cyclic permutations?

Let $X_1,\dots,X_n$ be non commutative variables such that $\operatorname{tr} f(X_1,\dots,X_n) = 0$ whenever the $X_i$ are specialized to square matrices in $M_r(k)$ for any $r \geq 1$. Does this ...
Asvin's user avatar
  • 7,746
13 votes
0 answers
1k views

Pointwise (Hadamard) matrix product and the rank

$\DeclareMathOperator{\rk}{rk}$ Suppose that $A$ is a square matrix of order $n$. If, for any polynomials $P$ and $Q$ with $\deg P+\deg Q\le 2$, we have $$ P(A)\circ Q(A^t) = P(1)Q(1)\, I_n \tag{$\...
Seva's user avatar
  • 23k
13 votes
2 answers
1k views

A log inequality for positive definite trace-one matrices

Let $\{v_i\}_{i=1}^N$ be a set of $n$-dimensional real vectors and let $X=X^\top\in\mathbb{R}^{n\times n}$ be a positive definite trace-one matrix. I would like to prove (or disprove) the following ...
Ludwig's user avatar
  • 2,712
13 votes
2 answers
697 views

in search of a transformation between determinants

Motivated by this MO question. Consider the two matrices $A_n$ and $B_n$ with entries $\binom{2j}i$ and $\binom{n+1}{2j-i}$, respectively; for $1\leq i, \,j\leq n$. I can show $\det A_n=\det B_n=2^{\...
T. Amdeberhan's user avatar
13 votes
2 answers
3k views

What's the Lipschitz constant of the exponential map for $\mathrm{SO}(n,R)$?

$\DeclareMathOperator\SO{SO}\DeclareMathOperator\so{\mathfrak{so}}$Consider the Lie algebra $\so(n)$ equipped with the metric $\langle e_i \wedge e_j, e_k \wedge e_l \rangle = \delta_{i,k} \delta_{j,l}...
John Jiang's user avatar
  • 4,466
12 votes
1 answer
415 views

Is the image of the map $A \to \bigwedge^k A$ closed over $\mathbb{R}$?

Let $V$ a real vector space of dimension $d$. Let $1<k < d-1$. Consider the map induced by the exterior algebra functor: $$ \psi:\text{End}(V) \to \text{End}(\bigwedge^kV) \, \, \, \, , \, \, ...
Asaf Shachar's user avatar
  • 6,741
11 votes
2 answers
714 views

A neat evaluation of an infinite matrix?

Let $M_n$ be an $n\times n$ matrix defined as $$M_n =\left[\frac{2i+1}{2(i+j+1)}\binom{i-1/2}i\binom{j-1/2}jx^{i+j+1}\right]_{i,j=0}^n.$$ With $I_n$ the identity matrix, consider $A_n:=I_n-M_n^2$. ...
T. Amdeberhan's user avatar
11 votes
3 answers
1k views

A class of matrix determinants between Wronskians and Vandermondes

Update: see below Let $M$ be an $n\times n$ matrix that's constructed as follows. Construct the right-most column of $M$ as $[\alpha_1(x_1),\cdots,\alpha_n(x_n)]^T$ for some class of fixed functions $...
Alex R.'s user avatar
  • 4,952
11 votes
1 answer
948 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 ...
Peter Heinig's user avatar
  • 6,051
10 votes
2 answers
7k views

Bounding the trace of a matrix product by the operator norms; generalized Hölder inequality?

$\DeclareMathOperator\Tr{Tr}$Let $A_i$ with $i=1,\dotsc,N$ and $p$ be real $M\times M$ matrices. Further, let $p$ be positive definite, i.e., $p\succ 0$, with $\Tr(p)=1$. Let $0< a_i<1$ and $\...
Tom Marks's user avatar
  • 103
10 votes
2 answers
2k 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 $$d(A,B)=\sqrt{1-\...
user35593's user avatar
  • 2,286
10 votes
1 answer
618 views

$2 \times 2$ matrix question

Let $A$, $B$, and $C$ be $2\times 2$ complex matrices, with $A$ and $C$ rank $1$ Hermitian. Can we find a real number $a$ and a $2\times 2$ unitary $U$ such that $$A + BV + V^*B^* + V^*CV$$ is a ...
Nik Weaver's user avatar
  • 42.8k
9 votes
2 answers
530 views

A "subtle" isomorphism testing problem: $\mathbb{Z}\ltimes_{A} \mathbb{Z}^5\cong \mathbb{Z}\ltimes_{B}\mathbb{Z}^5$ or not?

EDIT: I've made a mistake with the matrices. Now it is corrected. A couple of days ago I asked this question. There, answerers gave me excellent hints to solve that case and others too. But I've found ...
Alejandro Tolcachier's user avatar
8 votes
1 answer
321 views

"Almost Hankelized" numerical Vandermonde

One of the more utilized determinant is that of Vandermonde's $$\begin{vmatrix} 1&x_1&x_1^2&\dots&x_1^{n-1}\\ 1&x_2&x_2^2&\dots&x_2^{n-1}\\ \ldots&\ldots&\...
T. Amdeberhan's user avatar
8 votes
1 answer
492 views

Coordinate free isomorphism between $d+1$-dimensional antisymmetric rank $2$ tensors and $d$-dimensional symmetric rank $2$ tensors

The space of $(d+1)$-dimensional antisymmetric matrices has the same dimension as the space of $d$-dimensional symmetric matrices, $\frac12d(d+1)$. There are isomorphisms between the two spaces, e.g. ...
Josh Kirklin's user avatar
8 votes
1 answer
1k views

Grassmann–Plücker relations for permanents

Let $K$ be a field, $1 \leq d \leq n$ integers and $V$ an $n$-dimensional vector space. The Grassmann–Plücker relations are quadratic forms on $\bigwedge^d V$ whose zero set is exactly the set of ...
Gil Kalai's user avatar
  • 24.7k
8 votes
1 answer
1k views

Is there an efficient algorithm to check whether two matrices are the same up to row and column permutations?

Define $\mathcal M_n$ as the set of all $n\times n$ matrices with each entry either 1 or $x$. Two such matrices are equivalent iff they can be obtained from each other by swapping pairs of rows and ...
Wolfgang's user avatar
  • 13.4k
8 votes
2 answers
640 views

$2$-norm of idempotent matrix

Suppose $n > 1$ is an integer. Let $P \in \mathbb C^{n \times n}$ be a matrix such that $P^2=P$ and $1\leqslant {\rm rank}(P)<n$. Prove that $\Vert P \Vert_2 = \Vert I - P \Vert_2$. I have been ...
ForeverHaibara's user avatar
8 votes
1 answer
2k views

Symplectic block-diagonalization of a real symmetric Hamiltonian matrix

Given a $2n\times 2n$ real, symmetric, Hamiltonian matrix $W$ (anticommutes with the symplectic metric), is there an orthogonal, symplectic matrix $R$ such that $R^\top WR$ is block-diagonal? Being ...
Alex Monras's user avatar
7 votes
0 answers
264 views

Bound on gap between least eigenvalues of $n \times n$ correlation matrix and of its $(n -1) \times (n-1)$ submatrices

The following problem is motivated by one of my research problems. Let $\Sigma$ be an $n \times n$ correlation matrix whose least eigenvalue is denoted by $\lambda$. $\Sigma_i'$ be an ...
Saurabh Agrawal's user avatar
7 votes
1 answer
254 views

Eigenvectors of a matrix with entries involving combinatorics

In the question Eigenvalues of a matrix with entries involving combinatorics No_way asked about eigenvectors of $n\times n$ matrix $M$ with entries \begin{eqnarray*} M_{ij}=(-1)^{i+j}F(n, l, i, j), \...
Alexey Ustinov's user avatar
7 votes
2 answers
734 views

Does a non-singular matrix have a large minor with disjoint rows and columns and full rank?

Say I have an $n$-by-$n$ non-singular matrix $A$ all of whose diagonal entries are $0$. We call an $m$-by-$m$ minor of $A$ good if its set $I$ of row indices and its set $J$ of column indices ($I,J\...
H A Helfgott's user avatar
  • 20.2k
7 votes
1 answer
1k views

The saturation of Murray von Neumann relation

Edit: According to comment of Pace Nielsen, I remove question 2 of the previous version: Let $R$ be a unital ring. We define Murray Von Neumann relation $M$ on $R$ as follows: We say $a M b$ iff $...
Ali Taghavi's user avatar
7 votes
3 answers
621 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 ...
Favst's user avatar
  • 2,075
7 votes
1 answer
5k views

How much can a diagonal matrix change the eigenvalues of a symmetric matrix?

Suppose that we have a symmetric matrix ${\bf S}$ with eigenvalue decomposition ${\bf S} = {\bf Q}{\bf \Lambda}{\bf Q}^T$. Assume that we have two diagonal matrices ${\bf D}_1$ and ${\bf D}_2$ that ...
Anadim's user avatar
  • 449
6 votes
1 answer
996 views

Is there a smooth polar decomposition for non-invertible matrices?

Every $n \times n$ real matrix $A$ has a polar decomposition $A=OP$, where $O \in O_n, P$ is symmetric positive semi-definite. $P$ is uniquely determined by $A$, by $P(A)=\sqrt{A^TA}$, and when $A$ ...
Asaf Shachar's user avatar
  • 6,741
6 votes
3 answers
1k views

Norm of the upper triangular part of symmetric matrix

Let $D\in \mathbb{R}^{n\times n}$ denote a lower triangular matrix. With $\|\cdot\|$ denoting the spectral matrix norm, is there an estimate like $$ \|D\| \leq C\|D+D^T\|, $$ where $C>0$ is ...
Winfried's user avatar
  • 261
5 votes
1 answer
289 views

The spectral radius of a binary matrix - polynomial growth?

(This is a follow-up to The spectral radius of a binary matrix) Let $\mathcal B_n$ denote the set of $n\times n$ matrices with entries in $\{0,1\}$. QUESTION. Is there a $\delta\in\bigl(0,\frac12\...
Nikita Sidorov's user avatar
5 votes
2 answers
2k views

Iterated calculation of determinants

Given a $4 \times 4$ matrix $S$ over a commutative ring $R$. I want to consider it as a $2\times 2$ matrix over $M_2(R)$. Lets say $S=\left(\begin{array}{cc} A&B \\\ C&D\end{array}\right)$ ...
HenrikRüping's user avatar
5 votes
2 answers
266 views

Orthogonal Cauchy-like matrix

Given a $n \times n$ real Cauchy like matrix $C$, i.e., for real vectors $r$, $s$, $x$, $y$ $$ C_{ij} = \frac{r_i s_j}{ x_i - y_j} $$ Can a Cauchy-like $C$ be orthogonal, i.e., $C C^T = I$ for $n ...
Jiro's user avatar
  • 909
5 votes
3 answers
1k views

Algorithm for the intersection of a vector subspace with a cone of non-negative vectors

Hi, I would like to know whether there is some more effective way of how to compute an intersection of a vector subspace of $\mathbb{R}^{n}$ with a cone of vectors with non-negative entries than the ...
Miroslav Korbelar's user avatar
5 votes
0 answers
352 views

0-1 matrix combinatorial problem

Let $M \in \{0,1\}^{n \times n}$ and let $r_i$ be its $i$-th row. Given constant $p \in (0,1/2]$, let the number of $1$s in each row be at least $p\,n$. Given constant $c \in (0,1)$, what is the ...
Penelope Benenati's user avatar
4 votes
0 answers
1k views

Generalizing Autonne-Takagi factorization

Autonne-Takagi factorization (Léon Autonne (1915) and Teiji Takagi (1925)) says that: A complex symmetric matrix can be 'diagonalized' using a unitary matrix: If $A$ is a rank-$n$ complex symmetric ...
wonderich's user avatar
  • 10.5k
4 votes
1 answer
3k views

optimization of inverse matrix with constraint on matrix elements

everyone! I have this optimization problem with constraint. $D$ and $T$ are symmetric matrices, where T is known and D is the unknown parameter. $x$ and $v$ are two known p-dimensional vectors. The ...
Bing's user avatar
  • 49
4 votes
1 answer
183 views

Does an antisymmetric matrix with high rank have a minor with disjoint rows and columns and high rank?

This is a generalized version of Does a non-singular matrix have a large minor with disjoint rows and columns and full rank? Let $A$ be an $n$-by-$n$ antisymmetric matrix of rank $r\geq \epsilon n$. ...
H A Helfgott's user avatar
  • 20.2k
4 votes
1 answer
8k views

Detection of Redundant Constraints

Suppose I pose the following query to a constraint logic programming system: ?- Y <= 6 - X, Y <= (- 4) + 4 * X, Y <= 4 + X / 3. Are there systems that would recognize the last inequality as ...
user avatar
4 votes
1 answer
977 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 $$\sum_{i=1}^...
Ktb's user avatar
  • 41
3 votes
1 answer
381 views

Hadamard $\ell_p$ sum of two symmetric positive semidefinite matrices

Does there exist $p>1$ such that for all $n\geq 2$, if $(a_{ij})$ and $(b_{ij})$ are symmetric positive semidefinite $n\times n$ matrices and $a_{ij}, b_{ij}\geq 0$ then $\bigl(\|(a_{ij},b_{ij})\|...
D_809's user avatar
  • 175
3 votes
1 answer
457 views

On $\frac{(-1)^{(n-1)/2}}n\mathrm{per}\left[\tan\pi\frac{j+k}n\right]_{1\le j,k\le n-1}$ with $n\in\{3,5,7,\ldots\}$

Recall that the permanent of a matrix $A=[a_{j,k}]_{1\le j,k\le n}$ is given by $$\mathrm{per}(A)=\sum_{\tau\in S_n}\prod_{j=1}^na_{j,\tau(j)}.$$ Let $n$ be an odd integer greater than one. In 2019 I ...
Zhi-Wei Sun's user avatar
  • 15.6k

1
2
3 4 5
9