Skip to main content

All Questions

Filter by
Sorted by
Tagged with
21 votes
1 answer
2k views

Almost commuting unitary matrices

Suppose that $A_1,\dots, A_k$ are unitary matrices such that any two of them can be approximated by commuting unitary matrices. i.e. for any $i$ and $j$, there are unitary matrices $A_i'$ and $A_j'$ ...
Omid Hatami's user avatar
-1 votes
1 answer
173 views

finding a unitary submatrix inside a random matrix

Let $\mathbf{R} \in \mathbb{C}^{~m \times n} $ with $m \leq n $ be a random matrix, whose entries are i.i.d zero mean random variables with circularly symmetric Normal distribution. Let where $r$ be ...
Jeff's user avatar
  • 482
2 votes
0 answers
44 views

Nonconvex function on the singular value vectors of projected matrix

For a nonconvex function $p_\lambda(\cdot)$, with hyper-parameter $\lambda$, it can be decomposed into two parts that $p_\lambda(t) = \lambda |t| + q_\lambda(t)$, where $q_\lambda(t)$ is the concave ...
Agnes G.'s user avatar
5 votes
1 answer
231 views

What is the criterion for a matrix containing vectors and their permutations being invertible?

Consider the matrix $A\in\mathbb{R}^{m\times 2m}$. Let any arbitrary choice of $m$ columns of $A$ be linearly independent. Together with a permutation $P\in\mathcal{P_{2m}}$, one can build the matrix $...
Rob's user avatar
  • 271
15 votes
4 answers
4k views

Kernel of skew-symmetric matrix of rank $n-1$ with $n$ odd: is this a known result?

When $n$ is odd, the kernel of a skew-symmetric matrix $M$ of size $n\times n$ and rank $n-1$ is the span of $v$, where $v$ is a vector whose $i$-th component is the Pfaffian of the matrix obtained by ...
anderstood's user avatar
10 votes
0 answers
276 views

A $k \times n$ matrix with a lot of invertible $k \times k$ submatrices over $\mathbb{F}_2$

In the appendix of the paper by Tolhuizen ( http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=841182) there is a very fast and easy probabilistic proof that for $k=cn$ where $c \in [0,1]$ is fixed, ...
Daniel Soltész's user avatar
1 vote
0 answers
141 views

For of a special case of $Ax>=b$, are there always integer solutions?

The input consists of two integers $n\geq 2$ and $K\geq 2$, and a vector of positive integers $b$ of size $n$. We assume that $\sum_i b_i$ is a multiple of $K$. The output is a matrix $A(n\times n)$ ...
user2370336's user avatar
1 vote
0 answers
149 views

Product of elementary divisors

Let $A$ be an $(m \times n)$ integer matrix (if it helps, we can assume that a is a square matrix). Let $d_i,\ldots,d_s$ be the elementary divisors of $A$. I am interested in the product $\prod_{i=1}^...
Martin's user avatar
  • 1,101
4 votes
0 answers
171 views

How does scaling rows to sum to 1, of a positive matrix change the perron vector?

Reposting from math.sx due to lack of response. Let $A$ be a $N\times N$ positive matrix such that $A_{ij}>0$. By Perron-Frobenius theorem, there is a unique positive left eigenvector called Perron ...
dineshdileep's user avatar
  • 1,421
11 votes
0 answers
1k views

How the idea of adjugate matrix has been designed? [closed]

I can understand the adjugate matrix and the motivation of that to find the inverse, but I can't see how this idea was invented by mathematicians. It's just brilliance or someone understand how the ...
Ráfagan's user avatar
  • 219
2 votes
0 answers
90 views

Singularities of the Quantum propagator (baby version)

Given $a,b \in \mathfrak{su}(4)$ which are taken to generate the whole algebra, consider the following map $V:\mathbb{R}^{2} \rightarrow SU(4)$: $V : (w_1, w_{2}) \mapsto e^{(a+w_2 b)} e^{(a+w_1 b)}$ ...
Benjamin's user avatar
  • 2,099
9 votes
1 answer
307 views

a generalization of gamma matrices

Is it possible to find matrix solutions to the following : $$\left(\sum_1^m M_k x_k\right)^n=\left(\sum_1^m x_k^n\right)I_d$$ where $M_k$ are the desired $d \times d$ matrices (no restriction on $d$) ...
unknown's user avatar
  • 451
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 $...
Grigory Yaroslavtsev's user avatar
1 vote
0 answers
639 views

On triangular Toeplitz matrices

Let $R(x)$ be the upper triangular Toeplitz matrix with first row $x$, so that $R_{ik}=x_{k-i+1}$ if $i\le k$ and $R_{ik}=0$ otherwise. Let $N(n)$ be the smallest number $N$ such that there exist $u_j,...
Arnold Neumaier's user avatar
9 votes
0 answers
360 views

Finding $U,V$ in Thompson's Formula

Thompson's formula says, given $A,B \in \mathfrak{su}(n)$, there exists $U,V \in SU(n)$ such that: $e^{A}e^{B}=e^{UAU^{\dagger} + VBV^{\dagger}}$ Given $a,b \in \mathfrak{su}(4)$ defined by: $a=J_x ...
Benjamin's user avatar
  • 2,099
2 votes
0 answers
193 views

How to find moment condition for generalized method of moments?

Consider a scalar system with $2K$ outputs and $K+2$ unknowns: $y_{k,1}=x_ka_1+n_{k,1} \quad y_{k,2}=x_ka_2+n_{k,1}$. The variables $n_{k,\ell}$ are zero mean noise variables. To estimate $a_1$ and $...
Jonathan's user avatar
1 vote
1 answer
250 views

characterize certain type of matrices

I am trying to characterize matrices with a certain property : Define $U$ as an $n \times n$ matrix (over C or R; you can also assume that it is unitary or orthogonal if it helps). Now take $n$ ...
unknown's user avatar
  • 451
-4 votes
1 answer
387 views

Eigenvalues of real symmetric matrix [closed]

Suppose $A$ is a $n \times n$ real symmetric matrix with entries $a_{ij}\geq 1 $ and $a_{ii} = 0 $. Is it possible to have sum of the absolute eigenvalues of $A < 2 (n - 1).$
L S B. user255259's user avatar
1 vote
1 answer
2k views

Upper bound for sum of absolute values of eigenvalues of Hermitian matrix

Given a hermitian, but not necessarily positive, sparse matrix $C = (c_{ij}) \in \mathbb{C}^{n \times n}$ and $n \ggg 1$ ($n \approx 2^{100}$) with eigenvalues $\lambda_1 \le \lambda_2 \le \dots \le \...
user32422's user avatar
0 votes
2 answers
588 views

Estimating the shift in the $\lambda_{\max}$ of a matrix under a diagonal perturbation

Given a matrix $A$ and a diagonal matrix $D$, how can we estimate $\lambda_{\max}(A+D) - \lambda_{\max}(A)$? Feel free to make other assumptions about the matrices that they are all symmetric and have ...
InterlacingStudent's user avatar
15 votes
2 answers
997 views

Matrix equation $XAXBXC=I$

Let $A,B,C$ be unitary matrices. Does there always exist a unitary matrix $X$ such that $$(XA)(XB)(XC)=I,$$ where $I$ is the identity matrix? The quadratic equation $(XA)(XB)=I$ has the solution $A^*(...
Marco's user avatar
  • 213
5 votes
0 answers
187 views

Mapping the standard $(n!-1)$-simplex into $GL_n(\mathbb C)$

Let $\Delta^{n!-1}$ be the standard $(n!-1)$-simplex whose vertices are indexed by the elements of the symmetric group $S_n$, that is \begin{equation} \Delta^{n!-1} = \left\{ (t_\sigma)_{\sigma\in S_n}...
Chris Ramsey's user avatar
  • 3,984
4 votes
2 answers
202 views

Integral roots of circulant matrix

When does the circulant matrix have only integral roots? For example: all roots of the adjacency matrix of the complete graph $K_n$ are integer, which its adjacency matrix is circulant, but in case ...
L S B. user255259's user avatar
0 votes
2 answers
1k views

The condition number of a scaled Vandermonde matrix

Let $V(x_1,..,x_n)$ be the Vandermonde matrix induced by $x_1,..,x_n$, and let $\tilde{V} := V(\frac{x_1}{h},...,\frac{x_n}{h})$. My intuition says that the condition number should be invariant under ...
gil's user avatar
  • 265
0 votes
1 answer
229 views

Reference request: Strong Connectivity and the Incidence Matrix

Question: What would be a good reference for characterizations of strong connectivity of a digraph in terms of its incidence matrix? Details: Consider a digraph $(V, E)$ with vertex set $$V = \{v_1,...
orlandoweber's user avatar
3 votes
1 answer
433 views

Varieties parametrizing skew-symmetric matrices

Let $V$ be a vector space of dimension $n$ and let us consider the projective space $\mathbb{P}(\bigwedge^2V)$ parametrizing skew-symmetric matrices. Let $M\in\mathbb{P}(\bigwedge^2V)$, for any ...
user avatar
16 votes
1 answer
3k views

positive not completely positive maps

In extension to this question Positive but not completely positive? I'd like to know, for $k>1$, examples of $k$-positive linear maps of a matrix algebra into itself that are not $k+1$-positive. (...
Arnold Neumaier's user avatar
5 votes
0 answers
376 views

Non-linear positive map

In the paper titled "Nonlinear completely positive maps" M. D. Choi and T. Ando extended natural definition of completely positive maps ignoring the linearity condition (Aspects of positivity in ...
RSG's user avatar
  • 421
0 votes
1 answer
427 views

SO(3) transformation that produces a reflection [closed]

This came up doing some research in quantum information. Let us consider two orthogonal three-dimensional unit vectors $v$ and $w$ $v^T\cdot w=0$, and the Householder transformation $H=I_{3}-2v\...
Ricardo's user avatar
1 vote
2 answers
477 views

Worst case difference in rank by column-row swapping

Given a matrix $m\in\{-1,+1\}^{n\times n}$. Consider $m^\sigma$ to be collection of all matrices obtained from $m$ by permuting rows and columns. Consider $\mathscr{M}[m^\sigma]$ to be collection of ...
Turbo's user avatar
  • 13.9k
11 votes
1 answer
571 views

Expected size of determinant of $AA^T$ for random circulant and Toeplitz matrices

If $A$ is chosen uniformly at random over all possible $n$ by $n$ Toeplitz (or circulant) (0,1)-matrices, can we give any bounds for the expected size of the determinant of $AA^T$? All arithmetic is ...
Simd's user avatar
  • 3,377
5 votes
2 answers
4k 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} ...
Martin's user avatar
  • 1,101
3 votes
1 answer
445 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 ...
Turbo's user avatar
  • 13.9k
35 votes
3 answers
4k 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 ...
M. Lin's user avatar
  • 1,748
2 votes
1 answer
86 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 ...
Twi's user avatar
  • 2,188
3 votes
1 answer
266 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 ...
nullgeppetto's user avatar
1 vote
0 answers
138 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 $\...
Turbo's user avatar
  • 13.9k
5 votes
2 answers
550 views

Spectral radius of a rank-1 perturbation

Suppose that $\bf A$ is an $n \times n$ matrix, and $\bf u$ and $\bf v$ are vectors. The matrix determinant lemma lets us easily compute the determinant of ${\bf A} + {\bf u} {\bf v}^\top$, while the ...
user avatar
3 votes
1 answer
559 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} ...
Jay's user avatar
  • 31
6 votes
1 answer
192 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, ...
Jan-Christoph Schlage-Puchta's user avatar
1 vote
1 answer
546 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 ...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
148 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, ...
shahulhameed's user avatar
9 votes
1 answer
1k views

Computation time of Smith normal form in Maple

I am using Maple to compute the Smith normal form (SNF) of a $120 \times 120$ matrix and it seems that I will never get an answer back. I have checked my code for small cases and I believe that it is ...
Yibo Gao's user avatar
  • 356
7 votes
1 answer
6k 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 ...
Beni Bogosel's user avatar
  • 2,222
7 votes
2 answers
251 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 $...
user6818's user avatar
  • 1,893
0 votes
1 answer
130 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,∞) ...
Michael Jarret's user avatar
9 votes
1 answer
954 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 ...
Tadashi's user avatar
  • 1,590
1 vote
0 answers
85 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: ...
Peter Kottas's user avatar
1 vote
1 answer
82 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 ...
redfly10's user avatar
1 vote
0 answers
249 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 $E^{...
user6818's user avatar
  • 1,893

1
20 21
22
23 24
34