Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
184 views

Count N-tuples of commuting matrices over $F_q$ is given by polynomials with pattern $\sum q^{A_i(N)} P_{i}(q) $, where $P_i$ - do not depend on $N$?

Count pairs of $k \times k$ commuting matrices over finite field $F_q$ is given by certain polynomials in $q$ (which is quite rare phenomena for algebraic varieties) and have interesting generating ...
Alexander Chervov's user avatar
1 vote
0 answers
138 views

Questions on integer matrix multiplication

Question 1: Given two integer matrices $A$ and $B$, and let $C$ be $AB$. $C$ can be very big in pratice, so what is the fastest way to compute the statistical data of $C$? For example, $$A=\begin{...
user369335's user avatar
4 votes
0 answers
99 views

If matrices $A$ and $B$ are normal with $\sigma(A),\sigma(B)\subseteq \mathbb{R}\cup \mathbb{T}$, does $\text{rank}([A,B])=\text{rank}([A^*,B])$?

Here $\mathbb{T}=\{z\in\mathbb{C}: |z|=1\}$ denotes the unit circle in the complex numbers. This holds, if we have $\sigma(A)\subseteq \mathbb{R}$ or $\sigma(A)\subseteq \mathbb{T}$ (independent of $B$...
mathemagician99's user avatar
0 votes
0 answers
32 views

Eliminating nullity for enhanced non-singularity

If we have an $n\times n$ matrix $A$ with entries either $0$ or $1$, where all diagonal entries are $0$ and the rank is $k<n$, can we reach full rank by changing exactly $n-k$ zero off-diagonal ...
ABB's user avatar
  • 4,058
6 votes
1 answer
239 views

Attempts to define a matrix exponential over (as much as possible) general fields

Given a $n \times n$ matrix $A$ over the complex numbers, the exponential of $A$ is defined as $$\exp(A) := \sum_{k = 1}^\infty \frac1{k!} A^k , \qquad \tag{$\star$}\label{468645_star}$$ where ...
rosan98's user avatar
  • 361
1 vote
0 answers
95 views

Vandermonde-type factorization of moment matrix?

Consider $n,d \in \mathbb{N}_{>0}$, there are many functions $y:\mathbb{N}^{n} \to \mathbb{R}$. Now for simplicity, we denote $y(\alpha)$ to be $y_{\alpha}$. Let $|\alpha| = \sum_{i=1}^{n}\alpha_{i}...
patchouli's user avatar
  • 275
5 votes
2 answers
420 views

Maximum determinant of binary matrices with special properties

Let $A$ be an $n$-by-$n$ binary matrix (all elements are in $\{0,1\}$). It is known that the determinant of $A$ is bounded by $O(n^{n/2} / 2^n)$. I am looking for tighter upper bounds for matrices ...
Erel Segal-Halevi's user avatar
0 votes
0 answers
43 views

Given two rectangular matrices and they yield the same results when they are multiplied by their own transposes. What can we say about them?

Suppose we have $MM^T = NN^T$, where $M$ and $N$ are both $n$ by $d$ matrices. Assume that $n$ is (much) larger than $d$, are there anything we could conclude about $M$ and $N$, aside from that $N$ ...
Yrey's user avatar
  • 9
1 vote
1 answer
48 views

Iteration matrix representation with complex conjugate operator

I am studying the convergence of a particular class of radial power flows, whose goal is to obtain the voltage solution for a given electric grid, i.e., a complex vector $\mathbf{V}$ that gives the ...
ElectricPhysiscist's user avatar
3 votes
2 answers
392 views

Monotonicity of matrix conjugation

Let $A$ and $B$ be positive-definite matrices such that $A \le B.$ By matrix monotonicity of the root, this also implies that $A^{\alpha} \le B^{\alpha}$ for $\alpha \in [0,1].$ I am now curious under ...
António Borges Santos's user avatar
3 votes
0 answers
58 views

About a circular variant of Vandermonde matrix

Given an arbitrary $(x_1, \dots, x_n) \in [0, 1]^n$, is there any name/known results for the following $n \times n$ matrix (which is constructed by iterating $(x_1 \to \dots \to x_n \to x_1 \to \dots)$...
lntk's user avatar
  • 33
1 vote
2 answers
152 views

Property for bounding matrix exponential

Wikipedia states in the exponential map section about the exponential of a matrix that for any matrices $X$, $Y$ it holds that $\|e^{X+Y}-e^{X}\| \leq \|Y\|e^{\|X\|} e^{\|Y\|}$ where $\|\cdot\|$ ...
KatsanikJr's user avatar
0 votes
0 answers
82 views

some problem about the discrete of the first derivative operator

I am reading a paper (Parameter Choice Strategies for Multipenalty Regularization Massimo Fornasier, Valeriya Naumova, and Sergei V. Pereverzyev SIAM Journal on Numerical Analysis 2014 52:4, 1770-1794)...
bing's user avatar
  • 33
3 votes
0 answers
83 views

A stochastic matrix $B = \lambda(\lambda I - A)^{-1}$ such that $B-B^2$ has a non-negative diagonal

I apologize if this is too elementary a question, but I have not been able to make much progress. Consider a real matrix $A$ with $A_{ij} >0$ for $i \ne j$ and $\sum_{j} A_{ij} = 0$ for each $j$. ...
user133281's user avatar
0 votes
2 answers
62 views

Nondegeneracy of dominant singular value and positivity of dominant singular vector of connected nonnegative matrix

Call a (not necessarily square) nonnegative matrix $M$ connected if there do not exist permutation matrices $P$ and $Q$ such that $PMQ=\begin{pmatrix}A&0\\0&B\end{pmatrix}$ for some $A$ and $B$...
David Bevan's user avatar
2 votes
1 answer
278 views

Continuity of eigenvector of zero eigenvalue

Wonder whether anyone has an idea on showing the following or to point out that it is not true: Let $A(t) \in \Re^{n \times n}$ be differentiable over an interval $I$, and it has a zero eigenvalue for ...
muddy's user avatar
  • 69
4 votes
2 answers
180 views

What does the matrix-valued solution of $X = A X A^T + \operatorname{Id}$ look like?

Let $A \in \mathbb{R}^{n \times n}$ be an invertible contraction, i.e. all singular values are in $(0,1)$. By reformulating the equation \begin{align*} & X = A X A^T + \operatorname{Id} \tag{1} \...
Ben Deitmar's user avatar
  • 1,295
0 votes
2 answers
252 views

“Smallest” non-zero linear combination of vectors to obtain a non-negative vector

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix} where $x_{i} \geq 0$ for all $i=1,\...
Siddharth Iyer's user avatar
0 votes
0 answers
79 views

Quick calculation of a symmetric product with two indices

Say I have a product $\prod_{1\le i \le N-1}\prod_{i<j\le N-1} (1+t_i t_j a_{ij})$, where $a_{ij}$s are real number. I want to calculate the coefficient of $\prod_{0 \le i < N} t_i$. Is there an ...
pallab1234's user avatar
1 vote
2 answers
316 views

Right inverse of integer matrix

If I have a rectangular matrix $A$ (say $4 \times 6$) with integer entries, is there a way to tell whether it has a right inverse that also has integer entries. I know that if $AA^T$ has determinant $...
user61388's user avatar
1 vote
1 answer
178 views

Matrices over a finite field: matrices for which some unipotent $U$ satisfies Trace$(ZU)=0$ for all $Z$ in the commutant

Let $p$ be an odd prime number, let $A\in M_p(\mathbb{F}_p)$ be a $p$-by-$p$ matrix with coefficients in $\mathbb{F}_p$, let $C(A)$ be the commutant of $A$, and let $N\in M_p(\mathbb{F}_p)$ be a ...
loup blanc's user avatar
  • 3,741
3 votes
1 answer
146 views

The rank of a certain linear combination of mutually commuting nilpotent matrices

Let $A_1,\ldots,A_r$ be mutually commuting $n\times n$ nilpotent matrices over $\mathbb C$, the field of complex numbers. For any complex number $c$, let $A(c):=A_0+cA_1+c^2A_2+\ldots +c^rA_r$. We ...
sagnik chakraborty's user avatar
1 vote
1 answer
345 views

Solvability of $A X B=C$ with $X=X^\mathrm{T}$

I am studying symmetric solutions to the complex matrix equation \begin{equation} A X B=C, \end{equation} where $A$, $B$, and $C$ are $m\times n$, $n \times k$, and $m \times k$ complex matrices, ...
Juan's user avatar
  • 61
1 vote
0 answers
255 views

Interpreting positive semidefinite matrix as a graph

Given any symmetric matrix $S \in \mathbb{R}^{n \times n}$, if $S \succeq 0$, is there a way to encode $S$ into a graph such that it takes into account the positive semidefinite constraint, and ...
patchouli's user avatar
  • 275
0 votes
0 answers
309 views

Simultaneous triangulation and Jordan normal form of commuting nilpotent matrices

Let $A_1,\ldots,A_r$ be $n\times n$ nilpotent matrices over $\mathbb C$, the field of complex numbers, satisfying $A_i\cdot A_j=A_j\cdot A_i$ for all $i,j$. As the matrices commute, they admit ...
sagnik chakraborty's user avatar
2 votes
1 answer
213 views

Is matrix B obtained from matrix A?

Assuming a matrix $\mathbf{A} \in \mathbb{R}^{4096 \times 4096}$ sampled from a standard normal distribution $N(0, 1)$, and another matrix $\mathbf{B} \in \mathbb{R}^{4096 \times 4096}$ either sampled ...
eternity's user avatar
0 votes
1 answer
142 views

Matrix-order derivatives (differentiating a function a matrix number of times)

I have been exploring methods of generalizing the order of derivatives to a broader range of inputs (such as real numbers, complex, and now matrices). We are very well familiar with integer-order ...
charlesalexanderlee's user avatar
5 votes
1 answer
103 views

Interpolation between two matrices so that $L^p$ norm is controlled

Assume to have two square matrices $A$ and $B$ acting on $\mathbb{R}^n$ such that all their entries are in the interval $[0,1]$ and such that $||Ax||_1 = ||x||_1$ and $||Bx||_\infty \leq ||x||_\infty$....
tommy1996q's user avatar
0 votes
1 answer
524 views

What is the mathematician's definition of the determinant? [closed]

I am trying really hard to find a good definition of the determinant. I have looked virtually every single resource online and everybody gives a different answer: sum of cofactors or minors https://...
Olórin's user avatar
  • 179
7 votes
1 answer
305 views

Efficiently solve the Sylvester equation $AX+XA = C$ where $X$ is skew-symmetric

Is there a way (more efficient than the standard vectorization) to solve the following Sylvester equation in the skew-symmetric matrix $X$ $$AX+XA = C$$ where the matrix $A$ is symmetric positive ...
Gabi's user avatar
  • 173
4 votes
0 answers
262 views

Two questions about three circulant matrices

Consider the following matrix equation in $n \times n$ circulant $\pm 1$ matrices $A$, $B$, $C$ $$2AA^T+BB^T+CC^T=(4n+4)I-4J$$ where $I$ is the $n \times n$ identity matrix and $J$ is the $n×n$ matrix ...
user369335's user avatar
6 votes
2 answers
647 views

Is there a name for matrices of the form $a_{ij}=\frac{1}{a_{ji}}$?

I have a matrix that is “kind of symmetric.” Specifically, it is an $n \times n$ real matrix such that the entries $a_{ij}=1/a_{ji}$ whenever $j \ne i$. I want to investigate the properties of this ...
bryceadam1's user avatar
6 votes
0 answers
188 views

Expressing an invertible sparse matrix as a product of few elementary matrices

Let $M$ be an $n \times n$ matrix with integer entries. Suppose that $M$ is invertible (over the integers) and that $M$ has at most $An$ nonzero entries, each of which is less than $B$ in absolute ...
John Pardon's user avatar
  • 18.7k
2 votes
1 answer
264 views

Continuous path of unitary matrices with prescribed first column?

Consider a continuous curve $u \colon [0,1] \to \mathbb{C}^n$ where $u(t)$ is always a unit vector, $u(t)^* u(t) = 1$. Question 1: Does there exist a continuous curve $U \colon [0,1] \to \mathbb{C}^{n ...
ccriscitiello's user avatar
3 votes
1 answer
155 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
0 answers
72 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
1 vote
0 answers
97 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
0 votes
1 answer
134 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
2 votes
1 answer
226 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
1 vote
1 answer
270 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
36 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,741
1 vote
1 answer
217 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
  • 4,135
2 votes
1 answer
200 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
2 votes
1 answer
298 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
  • 557
1 vote
0 answers
134 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
0 votes
1 answer
171 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
  • 823
2 votes
1 answer
198 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
0 votes
0 answers
92 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
  • 159
2 votes
0 answers
137 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
  • 823
1 vote
2 answers
137 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
  • 135

1
2
3 4 5
34