Questions tagged [matrices]

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 tag ra.rings-and-algebras, co.combinatorics, etc. and other tags that might be applicable. There are also several more specialized tags concerning matrices.

Filter by
Sorted by
Tagged with
5 votes
1 answer
235 views

Self-linkage of the orthogonal group $O_n({\mathbb R})$.

In Exercise 153 of my list, it is proved that the connected components $SO_2({\mathbb R})$ and $O_2^-({\mathbb R})$ of the orthogonal group are linked as curves in the three-dimensional sphere defined ...
Denis Serre's user avatar
  • 51.6k
5 votes
1 answer
791 views

Orthogonal similarity of matrices

Given $M\in M_n({\mathbb R})$ and $\ell\in{0,\ldots,n-1}$, we define $$d_\ell(M)=\sum_{j=1}^nm_{j,j+\ell},$$ where the indices are understood mod $n$. In particular, $d_0$ is the trace operator. Let ...
Denis Serre's user avatar
  • 51.6k
5 votes
1 answer
548 views

Are there interesting problems involving arbitrarily long time series of small matrices?

Are there well-known or interesting applied problems (especially of the real-time signal processing sort) where arbitrarily long time series of small (say $d \equiv \dim \le 30$ for a nominal bound, ...
Steve Huntsman's user avatar
5 votes
1 answer
2k views

Self-similar matrices? [closed]

Does anyone know anything about self-similar (infinite) matrices, with more or less fractal(-like) structure and admitting meaningful matrix-algebra operations?
Igor Korepanov's user avatar
5 votes
1 answer
107 views

Estimating a symmetric positive-definite matrix from list of matrix vector products

I have a symmetric positive definite matrix (hessian) $H$ which is unknown and expensive to compute explicitly (circa 30*30) Indirectly in my code I have a growing list of pairs of unit vectors $u_i$, ...
SRB121's user avatar
  • 71
5 votes
1 answer
556 views

Public key cryptography based on non-invertible matrices?

Added Wed 13 Apr 2022 I have written a short note with experimental data, which shows not all pseudo keys are good keys. Public key cryptography based on non-invertible matrices We got public key ...
joro's user avatar
  • 24.2k
5 votes
1 answer
194 views

Smooth, non-analytic functions of non-normal matrices

My apologies if this isn't a well-enough-posed question, I think I'm partly unsure of what exact question to even ask. There are many different ways in which we can take a function of a matrix. We ...
Yonah Borns-Weil's user avatar
5 votes
1 answer
214 views

Are there any applications of the algebraic polar decomposition?

One of the decompositions mentioned in the Wikipedia page on matrix decompositions is the algebraic polar decomposition. This factors a square complex matrix $M$ into $M = SQ$ where $S = S^T$ and $QQ^...
wlad's user avatar
  • 4,843
5 votes
1 answer
190 views

Are there orthogonal Cauchy-like matrices with rational entries for any given size?

This is inspired by a recent question about the existence of orthogonal Cauchy-like matrices. It is proved that there are indeed such matrices, i.e. there are vectors $x,y,r,s\in\mathbb R^n$ such ...
Wolfgang's user avatar
  • 13.2k
5 votes
1 answer
261 views

Bounds on number of "non-metric" entries in matrices

Question: what upper bounds are known on the number of non-metric entries of finite dimensional square matrices $\boldsymbol{A}\in\mathbb{R}^{n\times n}$ with strictly positive off-diagonal elements $...
Manfred Weis's user avatar
  • 12.7k
5 votes
1 answer
151 views

Finding a particular matrix factor

Consider the following Laurent polynomial matrix-valued function in the variable $x\in\mathbb{C}$ $$ A(x) = \begin{bmatrix} 0 & x \\ x^{-1} & 0\end{bmatrix}. $$ I'm interested in finding a ...
Ludwig's user avatar
  • 2,682
5 votes
2 answers
242 views

Factoring a positive semidefinite matrix into binary matrices

This question is motivated by a research problem I recently encountered. Consider two sets of random variables $\mathbf{X}$ and $\mathbf{Y}$, where $\mathbf{Y}$ can be expressed as a linear ...
user135939's user avatar
5 votes
1 answer
194 views

Find the inverse of a more general matrix that is similar to the Hilbert matrix

In the last MO question , the following matrix is given: $$M_{ij}=\left[\frac{1+(-1)^{i+j}}{i+j-1}\right]$$ and its inverse has been discussed. Now the problem is further extended to a more general ...
Dings's user avatar
  • 153
5 votes
2 answers
368 views

Pfaffian of several skew-linear transformations / matrices

Introduction: Let's assume we have a 2-form $\alpha=(1/2)\sum_{j,k=1}^n a_{jk}\ e_j\wedge e_k$, where $n=2m$, and $a_{jk}\in\mathbb C$. We know that $\alpha^{\wedge m}=\alpha\wedge\alpha\dots\wedge\...
BarTov's user avatar
  • 53
5 votes
2 answers
439 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
5 votes
1 answer
2k views

Condition for block symmetric real matrix eigenvalues to be real

I have a $2n \times 2n$ block symmetric matrix that in the simplest case ($n=2$) looks like: $$ M_2 = \begin{bmatrix} a_1 & 0 & b_{1,2} & -b_{1,2}\\\ 0 & -a_1 & b_{1,2} & -b_{...
Giulia's user avatar
  • 151
5 votes
1 answer
337 views

Invariants of co-diagonalizability in real symmetric matrices

This question has been mentionned to me by U. Frisch. He wanders whether it has ever been considered by algebraists. In the vector space ${\bf Sym}_n({\mathbb R})$, two elements commutte to each ...
Denis Serre's user avatar
  • 51.6k
5 votes
1 answer
414 views

positive hermitian elements in $M_n(\mathbb{C})$

Elements of the set $P$ of positive hermitian $n×n$ matrices over complex numbers have some special properties: (i) they are closed under sum, (ii) they are closed under multiplication by positive ...
spelas's user avatar
  • 179
5 votes
1 answer
613 views

Characterizing invertible nonnegative matrices with bounded sums

Almost a year ago, I asked in this question about obtaining a tight bound on the sum of the entries of the inverse of a strictly positive definite matrix. Denis Serre gave a nice counterexample ...
Suvrit's user avatar
  • 28.4k
5 votes
1 answer
1k views

Convergence speed of Jacobi eigenvalue algorithm for parallel ordering(Brent-Luk) ?

Is there estimate for convergence of the Jacobi eigenvalue algorithm for Hermitian matrices for "parallel ordring" (Brent-Luk ordering (see comment below)) ? For example for 4 4 matrices parallel ...
Alexander Chervov's user avatar
5 votes
0 answers
157 views

Is the matrix multiplication exponent $\omega$ independent from the choice of the base field

The matrix multiplication exponent, usually denoted by $\omega_{F}$, is the smallest real number for which any two $n\times n$ matrices over a field $F$ can be multiplied together using ${\...
Nick Chen's user avatar
  • 151
5 votes
0 answers
419 views

Determinant of Hankel matrix with $a_n=(n!)^2$

Consider a Hankel matrix of the form $H_n(a_0(n))=\begin{pmatrix} a_0(n) & (1!)^2 & (2!)^2 & \cdots & (n!)^2\\ (1!)^2 & (2!)^2 & (3!)^2& \cdots & ((n+1)!)^2\\ (2!)^2 &...
fs98's user avatar
  • 51
5 votes
0 answers
175 views

Number of {0,1}-matrices with an even number of 1’s in each row vs in each column

I am working on an equation that would be solved if I show the following. Let $k \geq l$, and consider the set of $\{0,1\}$-matrices of size $k \times l$ with exactly $i$ 1’s. Consider the subset $\...
eti902's user avatar
  • 835
5 votes
0 answers
342 views

Divisibility properties of minors of matrices

Let $A$ be an $m\times n$ matrix with integer entries. Let $d_i(A)$ be the greatest common divisor of all $i\times i$ minors of $A$, and define $d_0(A)=1$. Whenever $i\leq j$, one has that $d_i(A)$ ...
Joel Louwsma's user avatar
5 votes
0 answers
206 views

Perturbation of Neumann Laplacian

Consider the $N \times N$ matrix $$A_{\alpha}=\begin{pmatrix} \lambda_1 & -1 & -\alpha & 0 & \cdots & 0\\ -1 & \lambda_2 & -1 & -\alpha & \cdots & 0\\ -\alpha &...
Guido Li's user avatar
5 votes
0 answers
122 views

Distance function on generalized upper half planes

Let $\mathbb{H}^n$ be the quotient $GL_n(\mathbb{R})/O(n) \cdot \mathbb{R}^\times$, which at least in the theory of automorphic forms is called a generalized upper half plane. We could also think of $...
Radu T's user avatar
  • 767
5 votes
0 answers
125 views

What is known about this conjectured symmetry in the generalized Radon-Hurwitz numbers?

The generalized Radon-Hurwitz number $\rho(m, n)$ is defined as the maximal dimension of a subspace contained in $Q_{m,n }$, the subset of all real $m\times n$ matrices $A$ which satisfy $AA^T=\lambda ...
Wolfgang's user avatar
  • 13.2k
5 votes
3 answers
228 views

Determine unknown matrix function of particular form from known points

I encountered the following problem recently in a practical context. Fix $n \ge 1$. Suppose $f$ is an unknown function $\mathbb C ^ {n \times n} \to \mathbb C ^ {n \times n}$ of the form $$ X \mapsto ...
user avatar
5 votes
0 answers
119 views

If power of two matrices becomes equal then stays equal, with left-side row multiplication

During my research on probabilistic automata (in joint Computer Science and Mathematics), I could reduce a certain problem to a problem of matrices. We are given the (element-wise) non-negative ...
Antonio AN's user avatar
5 votes
0 answers
73 views

Permanent of matrices of finite order

Assume $M$ is a $n \times n$-matrix with entries in $\mathbb{Z}$ such that $M^k$ is the identity matrix for some $k \geq 1$. Question 1: Is the permanent of $M$ non-zero? This is tested for many ...
Mare's user avatar
  • 26.1k
5 votes
0 answers
190 views

Number of elements in $\mathrm{GL}(n,p)$ with maximal order

I learned reading this question that $\mathrm{GL}(n,p)$ elements have at most a multiplicative order of $p^n -1$. I would like to know how many matrices have an order of exactly $p^n -1$. Do they ...
Cyrius Nugier's user avatar
5 votes
0 answers
239 views

Computing powers of a special matrix fast

I've got an $n\times n$ matrix that is upper-triangular (all zeros below diagonal), diagonal entries are positive, and entries that are not on the diagonal are either $0$ or $1$. An example matrix ...
Donald Gyllenhal's user avatar
5 votes
0 answers
95 views

Partitioning the set of Pauli words into abelian pieces

Let $\sigma_x,\sigma_y,\sigma_z$ be the Pauli matrices. A Pauli word of length $n$ is defined as the tensor product $\otimes_{i=1}^n\sigma_i$ of operators $\sigma_1,\dots,\sigma_n\in\{\mathbf 1,\...
Lviv Scottish Book's user avatar
5 votes
0 answers
426 views

Non-diagonalizable positive matrices

Let $n\geq 3$ and $E_n$ be the set of $n\times n$ matrices $A$ satisfying the $3$ following properties: $\bullet$ its entries $(a_{i,j})$ are positive integers. $\bullet$ the eigenvalues of $A$ are ...
loup blanc's user avatar
  • 3,574
5 votes
0 answers
91 views

elementary matrices over a regular ring

Let $n\in\mathbb{N}$ with $n\geq 3$. Let $A$ be a regular ring and $\gamma\in GL_{n}(A)$. We suppose that $\gamma$ is homotopic to the identity, i.e. there exists $\alpha\in GL_{n}(A[X])$ such that $\...
prochet's user avatar
  • 3,432
5 votes
0 answers
155 views

Operator norm of a soft thresholded symmetric matrix

Let $A$ be a symmetric real-valued $n\times n$ matrix and let ${\left\|A\right\|_{2\rightarrow 2}} := \max_{\left\|u\right\|_{2}\leq 1} \left\|Au\right\|_{2}$ denotes its operator norm (largest ...
Student's user avatar
  • 159
5 votes
0 answers
200 views

Resultant of a binomial and a trinomial

Does anyone know of any papers dealing with the resultant of a binomial $x^n+a$ and a trinomial $x^r+bx^s+c$ ? Even special cases would be of interest. (The resultant of two binomials is well known.)...
Gary McGuire's user avatar
5 votes
0 answers
1k views

a new proof of a square matrix is similar to its transpose (not completed)

I know there exist a classical way to prove that a square matrix is similar to its transpose in $C$ using jordan matrices. I would like to prove it in another way but i have some difficulities to ...
SC_thesard's user avatar
5 votes
0 answers
347 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
5 votes
0 answers
315 views

Is there a matrix with this specific quadratic determinant?

We have $\det M=(a+b)(c+d)$ where $M=\begin{bmatrix} a& 0& -1& 0\\ 0& c& 0& -1\\ b& 0& 1& 0\\ 0& d& 0& 1 \end{bmatrix}$ and $\det M'=(a'+b')(c'+d')$...
Turbo's user avatar
  • 13.7k
5 votes
0 answers
304 views

free subgroups of $SL_2(\mathbb{Z[i]})$

The group $SL_2(\mathbb{Z})$ contains many free subgroups, for example all of the principal congruence subgroups for $n\geq 3$ and the subgroup $\left\langle \left(\begin{array}{cc} 1 & 2\\ 0 &...
Ofir's user avatar
  • 243
5 votes
0 answers
133 views

Expectation of a specific random variable on the probability space of $n\times n$ matrices over $\{0,1\}$

Let $\mathcal{G}_{n,\frac{1}{2}}$ be the probability space of $n\times n$ matrices over $\{0,1\}$ and each entry of the matrix is independently equal to 1 with probability $\frac{1}{2}$ and equal to 0 ...
user173856's user avatar
  • 1,987
5 votes
0 answers
179 views

When is a Hermitian matrix of the form $g^*g$ for some matrix $g$

I tried asking this question on Math StackExchange and didn't get any replies. I was hoping that maybe someone here could help, sorry for duplicating. I'm trying to figure out some properties of ...
kneidell's user avatar
  • 993
5 votes
0 answers
214 views

Existence or construction of a sequence of orthogonal matrices with three properties

This is a problem that I encountered during my research, and I have spent a good amount of time on it without success. So I am reaching out for help .... Any pointers or suggestions are appreicated! ...
Chee's user avatar
  • 934
5 votes
0 answers
181 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,954
5 votes
0 answers
354 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
5 votes
0 answers
246 views

A weak Perron-Frobenius property for sets of positive matrices

A popular form of the Perron-Frobenius theorem states the following result: if $A$ is a $d \times d$ real matrix all of whose entries are positive, then the spectral radius of $A$ is a simple ...
Ian Morris's user avatar
  • 6,186
5 votes
0 answers
613 views

Is there a method to simultaneously block-diagonalize a set of group matrices?

Assume that you are explicitly given the representation matrices of a group. How does one go about finding that common basis which will find the irreducible components of all of them simultaneously? ...
user6818's user avatar
  • 1,883
5 votes
0 answers
415 views

When is a Hankel matrix invertible?

I would like to have some conditions that render a general Hankel matrix of the form \begin{pmatrix}a_1 & a_2 & a_3 &\cdots & a_n \\ a_2 & a_3 & a_4 & \cdots & a_{n+1} \...
baronbrixius's user avatar
5 votes
0 answers
319 views

Eigenvalues of Random Regular Bipartite Graphs

I am looking for a way of getting a good estimate of the eigenvalues of random bipartite d-regular graphs. The literature has very precise values the proofs of which are very involved and since I am ...
user1189053's user avatar

1
19 20
21
22 23
63