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)

0
votes
0answers
40 views

Matrix representation

Let $\mathbf{c}\in \mathbb{R}^n$ and $\mathbf{X}(s)= \begin{bmatrix} X_{11}(s) & X_{12}(s) & \cdots & X_{1n}(s) \\ X_{21}(s) & X_{22}(s) & \cdots & X_{2n}(s) \\ \vdots & ...
3
votes
2answers
109 views

Determinant of block tridiagonal matrices

Is there a formula to compute the determinant of block tridiagonal matrices, when the determinants of the involved matrices are known? In particular, I am interested in the case $A = \begin{pmatrix} ...
3
votes
1answer
162 views

Largest symmetric matrix given rank

Let $\mathscr{M}[n,d]$ be collection of $n\times n$ symmetric matrices with real entries from $\{0,1\}$ such that every row/column is distinct with sum of every row/column being $d$. What is minimum ...
26
votes
2answers
747 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 ...
2
votes
1answer
27 views

Information on special matrices similar to Jacobi matrices

Jacobi matrices are well known and deeply investigated mathematical objects from various point of view. One can arrive at these operators while studying discrete systems of particles interacting with ...
0
votes
1answer
39 views

Find inverse and determinant of a symmetric matrix - for a maximum-likelihood estimation

Evaluate the determinant $\det \Omega $ and find the inverse matrix $\Omega^{-1}$ of: $$\Omega = \begin{bmatrix} \beta_1^2(1+\theta_1^2) & \beta_1 \beta_2 & ... & \beta_1 \beta_{k-1} ...
0
votes
0answers
66 views

Invertible matrices sending a subspace into a disjoint copy of it

Assume $\{X_i\}$ and $\{Y_i\}$ are sequences of $n\times n$ matrices defined as: $X_0=I$, $X_1=0$ and $X_{i+1}=ABA^{-1}X_i+AX_{i-1}$ for all $i\geq1$, and $Y_0=0$, $Y_1=I$ and $Y_{i+1}=BY_i+Y_{i-1}$ ...
1
vote
1answer
115 views

Prove or disprove a matrix logarithm equation

Let $\Bbb{S}_{++}^n$ denote the space of symmetric positive definite (SPD) $n\times n$ real matrices, and let $A,B\in\Bbb{S}_{++}^n$. Is it possible to express the logarithm of $A^{-1}B$ as a ...
0
votes
0answers
57 views

Minimum rank of certain matrices

Let $\mathscr{M}[n]$ be collection of $n\times n$ matrices with real entries from $\{0,1\}$ such that every row is distinct and every column is distinct. What is minimum real rank of matrices in ...
0
votes
1answer
74 views

How much control do we have about shift in the largest eigenvalue of matrices under rank$1$ perturbations? [closed]

Do we have some characterization about when can we have something like, $\lambda_{max}(A + vv^T) - \lambda_{max}(A) = O(\frac{1}{dim(A)})$ ? If necessary restrict to a symmetric $0/1/-1$ matrix ...
0
votes
2answers
214 views

Representation Theory of $U(N)$

(1) Is it true that the category of representations of $U(n)$ is equivalent to the category of representations of $SU(N) \times U(1)$? If so, how is it proved, or what is a good reference. (I guess ...
1
vote
1answer
55 views

Determinant of a Certain Positive-Definite Block Matrix

Is there a lower bound for the determinant or minimum eigenvalue of the following $d$ by $d$ matrix in terms of $d$? $$\Gamma=\left( {\begin{array}{cc} I & B \\ B^{*} & I \\ \end{array} ...
1
vote
0answers
40 views

comparing norms of block-matrices

Let $k\in\mathbb{N}$ and let $d\in\mathcal{M}_k=\mathcal{B}(\ell_2^k)$ be a $k\times k$ diagonal matrix with strictly positive entries. Let now $x_1,\ldots,x_m\in\mathcal{M}_k\,\,(m\in\mathbb{N}$ - ...
6
votes
1answer
113 views

Monte-Carlo computation of the Smith normal form

Quite some time ago I saw an article where a Monte-Carlo algorithm for computing the Smith normal form of an integer matrix was described. In this article the following problem was posed: Suppose $P, ...
1
vote
1answer
121 views

Selecting columns of a set of boolean matrices with constraint on the ones in each row

I've come up with the following question in my research: Let $S$ be a finite set of $n \times n$ matrices with elements 0 or 1. denote $n_i$ as the total number of 1's in the $i$th row of all matrices ...
3
votes
3answers
245 views

Finding the square root of a special matrix

Let $n\in \mathbb N$ be a natural number, $x_1,\cdots.x_n$ be formal variables. Consider the following $n\times n$-matrix $M_n:=diag\{x_1^2+\cdots+x_n^2,\cdots,x_1^2+\cdots+x_n^2\}$, can we find a ...
2
votes
1answer
145 views

Vanishing of permanent of a Vandermonde matrix [Edited]

Does there exist an explicit criterion (or a good sufficient condition) for proving that a Vandemonde matrix: $$A(x_1,\dots,x_n):=\left[ \begin{array}{llll}1 & x_1 &\dots& x_1^{n-1}\\ 1 ...
2
votes
1answer
84 views

Is there a systematic relation between the generating functions for the rows vs that for columns of infinite sized Carleman-matrices?

(I've asked this in MSE but nobody had an idea since dec 14...) (Roughly related, but generalizing, of this earlier MSE question) Background: ...
1
vote
1answer
111 views

Row-stochasticity of the Jacobian matrix of a stationary distribution

Let $P_{\mathbf{p}}$ be a $n \times n$ row-stochastic matrix whose entries are a function of a probability vector $\mathbf{p} \in \mathbf{R}_{> 0}^n$, $\sum_i p_i = 1$ and define the following ...
0
votes
0answers
14 views

Markov chain: join states in Transition Matrix [migrated]

I need to merge two states in the Transition Matrix: For example: I have the matrix below ...
0
votes
0answers
47 views

Partial Vandermonde Circulant Determinant Expression

Consider following partial Vandermonde type, circulant matrix $\begin{bmatrix} x_1 & x_2 & 0 & \dots & 0 & x_n\\ x_1^2 & x_2^2 & x_3^2 & \dots & 0 & 0\\ \vdots ...
1
vote
0answers
50 views

Perturbation of eigenvalues of some special matrices

In perturbation theory of linear operators, one major question is how the eigenvalues of a linear operator $A$ change under a small perturbation, $A(x) = A + xP$, with $x\in\mathbb{R}$. For instance, ...
4
votes
0answers
69 views

Relation between Euclidean distance matrices and squared-distance matrices

Let us refer to $D$ as the matrix with $D_{ij} = ||x_i - x_j||_2$ and $H = D \circ D$ e.g. the matrix with $H_{ij} = ||x_i - x_j||_2^2$ as its entries. Are the spectra of these matrices related at ...
0
votes
0answers
36 views

Pseudo-braided fusion categories

A few definitions first, please replace with the standard terminology (and correct me if I confuse all the by-names of fusion categories :-) I call a complex number $z$ pseudo-cyclotomic if $|z|=1$. I ...
0
votes
0answers
52 views

Finding a “special” non singular submatrix

Given a square integer matrix $A \in M_n(Z)$ and two subsets $I, J \subset \{ 1, \ldots, n\}$, we define $A_{I,J}$ as the sub-matrix of $A$ containing the rows (resp. columns) whose index is in $I$ ...
3
votes
1answer
127 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 ...
2
votes
0answers
17 views

Is there some kind of lower bound for estimation error of the estimation of (near) low-rank matrices in high-dimension?

I'm reading S.Negahban and M.J.Wainright's paper, ESTIMATION OF (NEAR) LOW-RANK MATRICES WITH NOISE AND HIGH-DIMENSIONAL SCALING. In the paper, they give a upper bound for estimation error of the ...
6
votes
2answers
202 views

What methods do we have to understand the spectrum of matrices with restricted entries?

Consider questions of the form (or the "most probable value of" version of these questions rather than the "largest possible"), What is the largest possible spectral radius of a $n \times n$ matrix ...
7
votes
1answer
101 views

Determinant of some covariance matrix (Gaussian kernel process)

Let $x_1,\dots,x_p$ be $p$ points in $\mathbb{R}^n$ ($n\geq 2$) with $x_1=0$. Consider the symmetric matrix $M(x)=(m_{ij}(x))_{1\leq i,j\leq p}$ where $m_{ij}(x) = \exp(-\frac{1}{2}\Vert x_i - ...
0
votes
1answer
76 views

Reference for measures of commutativity needed

I'm looking for an appropriate measure to quantify the extent to which two matrices commute. In other words, if A and B are two n×n Hermitian matrices, and [A,B]=C. I'd like a function μ:Cn×n→[0,∞) ...
6
votes
1answer
200 views

Convexity of the product of two exponential matrices

Let $S\subset\mathbb{R}$ be a convex set and $\mathbb{S}^{n}$ be the set of real symmetric matrices of order $n\times n$. A matrix valued function $\Gamma: S \rightarrow \mathbb{S}^{n}$ is said to ...
1
vote
0answers
57 views

Smallest sum of original column entries in 2d matrix [closed]

I have an interesting optimization problem I am trying to solve now and I thought I'd share it here in order to find the best answer. The problem itself is not complicated and it is stated like this: ...
1
vote
1answer
58 views

Given $M$, minimize $|Mx|_0$

Given a matrix $M \in \mathbb{R}^{n \times m}$, I would like to find $\min_{x \in \mathbb{R}^m} \|Mx\|_0$ such that $x \neq 0^m$, where the $\ell_0$ "norm" is measured by simply counting the number ...
0
votes
0answers
58 views

Derivative of a conjugation of matrices

Let $\mathcal{M}_n$ be the space of complex $n\times n$ matrices. Let $\Phi\colon \mathbb{D}\to \mathcal{M}_n$ and $\psi \colon \mathbb{D}\to \mathcal{M}_n$ be holomorphic functions. Consider the ...
0
votes
0answers
63 views

prove that a function is approximatively three dimensional

Let $D_n(x)$ be a diagonal matrix of size $N\times N$ where the $k$th element is $\exp(2\pi\jmath x(n+(k-1)/N)$. Let $P_n$ be a random diagonal $N\times N$ matrix where each diagonal element is a ...
1
vote
0answers
155 views

Is there a way to simplify this apparently huge characteristic polynomial calculation?

Say I am given the $0/1$ adjacency matrix of an undirected graph. Also I am given a representation $\rho$ of some group $G$ and an orientation has been arbitrarily chosen along each edge. Let ...
8
votes
5answers
558 views

Analogue of Cayley Hamilton theorem for operators on Hilbert space

Is there an analogue of Cayley Hamilton theorem which holds for operators on a separable Hilbert space. Obviously the characteristic polynomial will be replaced by something else.
8
votes
2answers
371 views

On closest unitary matrix

In this question $\|A\|_p$ is the normalized $p$-th Schatten norm which is defined to be $\left(\mathbb E_{i} \lambda_i^p\right)^{1/p}$, where $\lambda_i$ are singular values of matrix $A$. Suppose ...
44
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 + ...
1
vote
0answers
47 views

Optimization with random matrix

Consider $J$ a random matrix of size $n\times n$ with i.i.d. Gaussian entries $J_{ij} \sim \mathcal{N}(0,\sigma^2/n)$. Let $f(x)=tanh(x)$, and for $x\in\mathbb{R}^n$, $f(x)$ denotes the vector where ...
2
votes
2answers
259 views

Is anything known about the eigenspectrum of the regular representation of the permutation group?

I am looking for information like upper bounds on how many times any eigenvalue can occur or something like how many eigenvalues can be there in some given range. Is anything like this known? The ...
0
votes
0answers
49 views

Centralizer of a non-regular Lie algebra element

It is well understood that the centralizer of a regular element $A$ of a Lie algebra of complex (square, diagonalizable) matrices consists of polynomials $p(A)$ in that element of degree less than $n$ ...
1
vote
0answers
28 views

LU growth factor applied to LDL of a Positive Semidefinite matrix [closed]

For a Positive Semidefinite matrix $A$, which we can decompose through $LDL$ decomposition as follows: $A=LDL^\text{T}$; how can we prove that for a decomposition $A=LU=L(DL^\text{T})$, the growth ...
1
vote
0answers
77 views

Is my particular finite dimension Toeplitz matrix always strictly positive?

Let $H(\omega), \; -\pi \leq \omega \leq \pi$ be a real-valued function with a continuous band of zeros, that is (for simplicity) $H(\omega)=0, \; |\omega|\geq \beta \pi$. Define a sequence of banded ...
2
votes
0answers
180 views

An (open?) problem about a sequence of nested principal sub-matrices and their determinants

Problem: Let $A$ be a $n \times n$ integer matrix, $\det(A) = \pm 1$. Under which conditions there exist a nested sequence of principal submatrices of size $n$ such that they all have determinant $\pm ...
5
votes
0answers
96 views

Geometric interpretation of the Desnanot-Jacobi Identity

Given a square $n\times n$ matrix $M$, let $M_i^j$ denote the $(n-1)\times(n-1)$ matrix obtained from M by omitting the i-th row and j-th column of $M$. The Desnanot-Jacobi Identity states ...
2
votes
1answer
228 views

Lebesgue measure of set of $y\in\mathbb{R}^n$ such that $x,y,Ay$ are linearly dependent

I've asked this question here on math.stackexchange, but I have been unable to solve this yet, so I'm hoping I can get some advice here. Consider a vector $x\in \mathbb{R}^n$ and a real $n\times n$ ...
2
votes
1answer
77 views

Does Schatten-p (quasi-)norm satisfy the norm inequality for 0<p<1?

I'm reading the paper by ANGELIKA ROHDE AND ALEXANDRE B. TSYBAKOV, ESTIMATION OF HIGH-DIMENSIONAL LOW-RANK MATRICES. And in the paper, they provide an inequation of the Schatten-p (quasi-)norm, ...
8
votes
0answers
83 views

What is the symmetry group fixing norms of elements of a unitary matrix?

Let $N\geq1$ be an integer and let us say that two matrices $U,V\in U(N)$ are related if $|U_{ij}|=|V_{ij}|$ for all indices $1\leq i,j\leq N$. When exactly are two unitary matrices related in this ...
0
votes
2answers
68 views

Symmetric matrix from a nonsymmetricc matrix

Basically this is a part of a long algorithm to calculate some matrix properties. Given an upper triangular square matrix R, how can I find an orthonormal matrix W (possibly iteratively) such that WR ...