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
0 votes
0 answers
21 views

Does there exist an axiomatic unsupervised approach for Link prediction based on either distances or matrices?

Does there exist an axiomatic unsupervised approach for Link prediction based on either distances (in my pasted link - related to the Graph theory's Closeness centrality) or matrices (i.e., if we fake ...
6haidang's user avatar
2 votes
1 answer
110 views

Does this matrix equation always have a solution?

Let $\{A_i, i\ge 3\}$ be the matrices whose columns represent numbers from $0$ to $2^i-1$ in binary form. For example, $A_3 = \begin{bmatrix} 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 \...
Arnaud Casteigts's user avatar
1 vote
1 answer
35 views

Wold decomposition of toral endomorphisms

Suppose that $A\in M_d(\mathbb{Z})$ is a $d \times d$ matrix with non zero determinant and suppose that $\mathbb{T}^d$ is the $d$-dimensional torus. Then one can define an operator on $L^2(\mathbb{T}^...
an_ordinary_mathematician's user avatar
-2 votes
0 answers
47 views

Let A be a 4 × 4 matrix. Let λ be an eigenvalue of A. Suppose the geometric multiplicity of λ is 2 [closed]

Prove that if A is diagonalizable, then there exists a0, a1, a2 ∈ R such that A^3 + a2A^2 + a1A + a0I4 = 0. I don't even know where to start. I've tried implementing a method similar to this, but I ...
buyadeer's user avatar
0 votes
0 answers
13 views

Low-rank factorization of a Finite Element matrix

I have a matrix $M\in \mathbb R^{n\times n}$, stemming from a Finite Element discretization of an advection function. I want to find a factorization $ M= S E T $ with $S, T\in \mathbb R^{n\times s}$ ...
MisterWulf's user avatar
0 votes
0 answers
102 views

Find good representatives for something related to the orbit of $\mathrm{GL}_n\times \mathrm{GL}_m$ acts on $M_{n,m}$

$\DeclareMathOperator\GL{GL}$Fix a field $F$, and we only talk about spaces and groups over it. We consider the $n\times m$ matrix space denoted by $M$. And $\GL_n \times \GL_m$ acts canonically on $M$...
Adjoint Functor's user avatar
0 votes
0 answers
88 views

Find the eigenvalues and eigenvectors of a symmetric invertible matrix multiplied by an antisymmetric matrix

Let $A$ is an invertible symmetric matrix and $B$ is an antisymmetric matrix. $$ \mathbf{A}= \left( \begin{array}{cc} M & 0 \\ 0 & S \end{array} \right) \qquad \mathbf{B}= \left( \begin{array}...
zx x's user avatar
  • 1
1 vote
0 answers
38 views

Eigenvalues of a subset of matrix semigroup

My apologies for slightly longer post but I wanted to explain lower dimensional cases and their proofs before asking the actual question, which starts after the phrase The general case below. A two-...
Maulik's user avatar
  • 111
3 votes
1 answer
81 views

Calculate the Riemannian Hessian of Karcher mean problem on positive definite matrices

Consider a collection of positive definite matrices $\{A_1,...,A_n\}\in\mathbb{S}_{++}^d$, the Karcher mean of these matrices is given by (see (5.4) in [1]): $$ \min_{X\in\mathbb{S}_{++}^d} f(X):=\...
Jason Li's user avatar
  • 125
1 vote
0 answers
79 views

Non-vanishing principal minors up to swapping columns

An undergraduate student asked me the following seemingly easy question. After a few days of thinking, I still couldn't come up with an answer, nor could I find one online. Maybe folks here could help?...
Qixian Zhao's user avatar
9 votes
2 answers
535 views

Are these two methods for constructing Hadamard matrices known?

These two observations came while researching the empty set of odd perfect numbers and unitary perfect numbers: Context: Let $n$ be a natural number and $D_n$ be the set of divisors. We can make this ...
mathoverflowUser's user avatar
-2 votes
0 answers
51 views

An determinant inequality of strictly diagonally dominant matrix [migrated]

Recently, I have seen a matrix inequality but don't know how to prove it. The inequality goes as follows. Matrix A is a strictly diagonally dominant matrix. image of inequality I encounter it in my ...
苏茂江's user avatar
1 vote
0 answers
74 views

Pre-positive definite functions?

A function $f(x,y)$ is positive definite if matrices $( f(x_i, x_j) )_{i, j \in F}$ are positive definite for all finite index sets $F$. This is frequently hard or impossible to check given some ...
tsnao's user avatar
  • 402
0 votes
1 answer
112 views

Existence of cyclic subspace decompositions for pairs of commuting matrices

Let $\mathbb{K}$ be an arbitrary field (possibly finite). Let $V$ be a finite-dimensional vector space over $\mathbb{K}$, and let $A,B$ be two linear endomorphisms of $V$ which commute. For $v\in V$, ...
Abdelmalek Abdesselam's user avatar
-1 votes
0 answers
34 views

Strassen factorization for $n \geq 3$ [migrated]

There is the famous Strassen matrix multiplication method (see here for further information). In essence it boils down to the fact, that we can multiply 2x2 matrices with each other and don't have to ...
tobias's user avatar
  • 727
0 votes
0 answers
61 views

Interpretate a condition on Signed graph

In my research I came up with a condition on signed complete graph as follows: Consider adjacency matrix of signed complete graph, i.e. symmetric, diagonal-free matrix with elements $A_{ij}=-1$ or $+1$...
tony's user avatar
  • 333
2 votes
1 answer
164 views

Inductive Cholesky decomposition to prove that a function is positive definite over the natural numbers?

I am trying to prove that the function: $$k(a,b):=\frac{1}{\operatorname{rad}\left ( \frac{ab}{\gcd(a,b)^2} \right )}$$ is a positive definite function over the natural numbers. What has sometimes ...
mathoverflowUser's user avatar
8 votes
3 answers
507 views

Jensen-like inequality for random matrix: $\Bbb E[\det X^2]\ge\det\Bbb E[X^2]$

Let $X\in M_n(\Bbb R)$ be a random matrix with iid elements following a continuous distribution. What are the necessary and sufficient conditions for $$\Bbb E[\det X^2]\ge\det\Bbb E[X^2]$$ to hold? Is ...
TheSimpliFire's user avatar
1 vote
1 answer
193 views

Solve permutation matrix equations of the form: $X^T A X = B_1$ and $X A X^T = B_2$

I have a hard time solving the following two matrix equations for unknown permutation matrix $X \in \mathbb{R}^{n \times n}$: $$X^T A X = B_1$$ $$X A X^T = B_2$$ where, $A$, $B_1$ and $B_2$ are all $n ...
Danish's user avatar
  • 11
33 votes
4 answers
2k views

Determinant of the random matrix $X^2+Y^2$

$\DeclareMathOperator\Prob{Prob}$Let $X,Y\in M_n(\mathbb{R})$ be $2$ random matrices. The entries of $X,Y$ are i.i.d. variables. They follow the standard normal law $N(0,1)$. i) When $n=2,3,4$, one ...
loup blanc's user avatar
  • 3,432
1 vote
1 answer
144 views

Is there a necessary and sufficient condition to determine whether a number sequence can serve as the first few moments of a Radon measure?

Given a few positive numbers $(M_1, M_2,\cdots, M_K)$, they are the moments of a measure if \begin{equation} M_k = \int d\mu(x) x^k,\quad k = 1,2,\cdots,K. \end{equation} This is related to the ...
Yi Changhao's user avatar
2 votes
0 answers
135 views

What are the name and inverse of an interesting integer matrix?

It is practicable to compute the matrix inverses \begin{align*} \begin{pmatrix} 1 & 0 & 0 \\ 1 & 1 & 1 \\ 1 & 2 & 2^2 \\ \end{pmatrix}^{-1} &=\begin{pmatrix} 1 & 0 &...
qifeng618's user avatar
  • 796
5 votes
2 answers
335 views

How expressive is $e^A$ in the sense of universal approximation?

For any real matrix $B\in\mathbb{R}^{n\times n},n\ge 2$ and precision $\varepsilon$, is there a real matrix $A\in\mathbb{R}^{n\times n}$ such that $\|e^A-B\|_F<\varepsilon$? ($F$ refers to ...
li ang Duan's user avatar
0 votes
1 answer
144 views

Perturbation of matrices

Let $A(t)$ be a symmetric $n\times n$ matrix that continuously depend on $t\in [0,1]$. Let $\lambda_1(t)$ stand for the smallest eigenvalue for $A(t)$. Question. Does there exist a Lebesgue measurable ...
Ali's user avatar
  • 3,987
1 vote
1 answer
192 views

Conditions of P for existence of orthogonal matrix Q and permutation matrix U satisfying QP = PU

Question: Let $P\in \mathbb{R}^{d\times n}$ be a $d$-rank real matrix and $PP^T = c I_d$ with a certain constant $c > 0$. Under what additional conditions of $P$ does there exist an orthogonal ...
Eddie Lin's user avatar
  • 187
2 votes
1 answer
106 views

Upper bound for the rank of a Gram-type matrix

Let $V = (v_{1},...,v_{N})$ and $W = (w_{1},...,w_{N})$ be 2 sets, each containing $N$ vectors from $\mathbb{R}^{n}$; i.e, $v_{j}, w_{j} \in \mathbb{R}^{n}$ for all $1 \leq j \leq N$. Assume that $N$ ...
Tomer Milo's user avatar
0 votes
1 answer
543 views

A RKHS interpretation of the Rydberg formula for hydrogen and an application for physics?

I was thinking if it is possible to define an inner product between two small physical objects with a positive definite kernel and was led to look at the Rydberg formula: The Rydberg formula for ...
mathoverflowUser's user avatar
2 votes
1 answer
249 views

Is there a combinatorial interpretation for the change of basis matrix in the Frobenius normal form representation?

Let $G$ be a graph on $n$ vertices. Let $A$ be the adjacency matrix of $G$ (i.e., rows and columns of $A$ are indexed by vertices of $G$, and the $(v,w)$ entry of $A$ is $1$ if $(v,w)$ is an edge in $...
Naysh's user avatar
  • 455
1 vote
0 answers
88 views

Matrix valued word embeddings for natural language processing

In natural language processing, an area of machine learning, one would like to represent words as objects that can easily be understood and manipulated using machine learning. A word embedding is a ...
Joseph Van Name's user avatar
2 votes
0 answers
111 views

What is the quantity $\sqrt{\frac{c^2+d^2}{a^2+b^2}}$ of a matrix with determinant one?

Suppose that $A \in \mathbb R^{2 \times 2}$ has determinant one, $$ A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} $$ I'm currently working on a problem where I obtained a condition on the ...
Muzi's user avatar
  • 163
0 votes
0 answers
56 views

Prime index subgroups of $\langle Q^{i}(\mathbb Z^{2}) \mid i \in \mathbb Z \rangle$ that is invariant under matrix $Q$

Let $Q $ be a matrix in $ \operatorname{GL}(2, \mathbb{Q}) $ and consider the group $G = \langle Q^{i}(\mathbb Z^{2}) \mid i \in \mathbb Z \rangle := \langle Q^{i}(v) \mid i \in \mathbb Z, v \in \...
ghc1997's user avatar
  • 763
0 votes
0 answers
37 views

Is there any generalization of the convexity of $t^{-p}$ for $p > 0$ for real symmetric positive definite matrices?

Let $p > 0$. On the positive reals, $t \mapsto t^{-p}$, is a convex function, as can be seen easily by a plot or differentiation. However, unfortunately, unless $p \in (0, 1]$, the map $f_p(X) = X^{...
Drew Brady's user avatar
2 votes
1 answer
140 views

An inequality related to matrix trace

$$Tr(A|A^T U \Sigma U^T|) \leq Tr(AA^T U \Sigma U^T)$$ where $A \in \mathbb{R}^{m\times n}$ is a real rectangular matrix, $U \in \mathbb{R}^{n \times n}$ is a orthonormal matrix and $\Sigma$ is a ...
Wayne's user avatar
  • 21
4 votes
1 answer
158 views

Conditions for distinct nonzero eigenvalues in product DAD for symmetric matrix A with repeated nonzero eigenvalues and diagonal matrix D

Let $A\in\mathbb{R}^{n\times n}$ be an real symmetric matrix with eigenvalues $\lambda_1, \lambda_2, \cdots, \lambda_n$ with some of which be nonzero and repeated, i.e., there exist $\lambda_i \ne 0$ ...
Eddie Lin's user avatar
  • 187
1 vote
1 answer
97 views

square matrix depending on complex value: spectral radius continous? [closed]

Let $A(z)$ be a $n\times n$ square matrix depending on the complex value $z$ and $\lambda_z$ is its spectral radius. Is $\lambda_z$ continous or is it possible that it can jump? Or maybe someone knows ...
Fynn13's user avatar
  • 83
0 votes
0 answers
58 views

Norm of matrix product sum

Given matrices $A_{n\times n}, B_{n\times m}, C_{m\times m}$ such that $A^iBC^{N-i}$ is matrix with all zeros except upper right element for all $i$ from $0$ to $N$, what can we say about Frobenius ...
D.Ult's user avatar
  • 1
4 votes
1 answer
201 views

Diameter of the unimodular group with Gauss moves

$\DeclareMathOperator\GL{GL}$Consider the unimodular group $\GL_n(\mathbb{Z})$, consisting of integral matrices $A \in \mathbb{Z}^{n \times n}$ such that that $\det(A) =\pm 1$. It is well known that ...
gm01's user avatar
  • 321
2 votes
0 answers
105 views

Decompose a rational matrix as an integer matrix and an inverse of integer matrix

Suppose we have a non-singular rational matrix $Q$, consider the the $\mathbb{Z}$-span of the columns of $Q$ and $Q^{-1}$, denote it as $H = {\rm Span}_{\mathbb Z} \{ Q(\mathbb Z^{n}), Q^{-1}(\...
ghc1997's user avatar
  • 763
1 vote
2 answers
106 views

Methods to solve for a matrix whose entries satisfy certain properties

(This question is a repost of a deleted question I asked, because the previous version had several elements missing) Setting For fixed $N \in \mathbb{N}$, I wish to compute the entries of a matrix $...
algebroo's user avatar
  • 113
1 vote
1 answer
163 views

Optimal transport between two matrices

I'm investigating the use of optimal transport to define a distance between non-negative matrices that satisfy the condition $\mathbf e^\top\mathbf M\mathbf e = 1$ (i.e., the sum of all elements in ...
Peyman's user avatar
  • 243
0 votes
0 answers
20 views

Are there any known lower complexity bounds on solving positive semidefinite or positive semidefinite feasibility problems?

I've been trying to attack the problem posted here, about quickly checking if a matrix has any positive semidefinite completions. I suspect that the answer to the question is "no", because ...
seed's user avatar
  • 101
5 votes
2 answers
469 views

Is there a name for this family of matrices?

Let $0<a_1<a_2<\cdots<a_n$ and let $A$ be the symmetric $n\times n$ matrix with ${ij}^\text{th}$ entry $A_{ij}=\min\{a_i,a_j\}$. For example, if $a_i=i$ for each $i\le n=5$ then $$A=\begin{...
bldavies's user avatar
0 votes
1 answer
214 views

How to represent infinite matrices in Mathematica?

I asked this question on Mathematica site and the answer was basically "it is impossible". So, some math theory needs to be thrown in besides coding. Let us represent infinite matrices as ...
Anixx's user avatar
  • 9,294
2 votes
0 answers
45 views

What conclusions can I derive from this family of trace inequalities?

Problem. Let $n_1,\ldots,n_s,m_1,\ldots,m_s\ge 0$ be nonnegative integers and set $m := \sum_{i=1}^s m_i$ and $n := \sum_{i=1}^s n_i$. Let $\oplus$ be an operation on matrices which stacks them in a ...
eepperly16's user avatar
1 vote
1 answer
189 views

Smith normal form and last invariant factor of certain matrices

I've copied over this question from what I asked on Mathematics Stack Exchange, in the hope that some experts can provide some relevant insight. Suppose we have row vectors $x_1$, $x_2$ , $y_1$ , $y_2 ...
ghc1997's user avatar
  • 763
9 votes
1 answer
338 views

Conjugates iff conjugates over $\mathrm{GL}_n(\overline{\mathbb{F}_q})$?

Let $G$ be a connected, almost simple linear algebraic group defined over a finite field $\mathbb{F}_q$. Let $g, g'\in G(\mathbb{F}_q)$ be conjugates by an element of $\mathrm{GL}_n(\overline{\mathbb{...
H A Helfgott's user avatar
0 votes
1 answer
43 views

Matrix sparsity pattern from Boolean condition

I would like to determine the sparsity pattern of a matrix $A_m$, where the entry $(k,l)$ of $A_m$ is non-zero if the condition $\operatorname{test}(k,l,m)$ is true: $\operatorname{test}(k,l,m)$ = &...
Mathieu le provost's user avatar
0 votes
0 answers
110 views

Bound on the number of connected components of a linear algebraic group $G<\mathrm{SL}_n$?

Let $G<\mathrm{SL}_n$ be a linear algebraic group defined over a field. Is there a bound on the number of connected components of $G$ in terms of $n$ alone? (The bound will evidently not be any ...
H A Helfgott's user avatar
1 vote
0 answers
107 views

Some kind of product of two 2d tensors to create a 3d tensor?

I recently need to apply the following concept of product of two 2d tensors to create a 3d tensor (tensors understood as generalized arrays): given two 2d tensors $A_{m\times n}$ and $B_{n\times p}$, ...
Min Wu's user avatar
  • 461
1 vote
1 answer
97 views

Minimal number of linearly dependent rank-1 projectors

What is the minimal number of linearly dependent rank-1 projectors $\vec v \vec v^t$ in dimension n, under the condition that every set of n column vectors $\vec v$ is linearly independent. PS: the ...
Alberto Montina's user avatar

1
2 3 4 5
62