Skip to main content

All Questions

Tagged with or
Filter by
Sorted by
Tagged with
2 votes
1 answer
153 views

What conditions on the rate matrix $Q$ ensure unique convergence in continuous-time Markov chains?

In the study of discrete-time Markov chains, the conditions under which all initial distributions converge to a unique stationary distribution are well-understood. Specifically, if the transition ...
Zhang Yuhan's user avatar
3 votes
0 answers
118 views

A matrix-valued analogue of a classical inequality

Let $p \geq 4$ be an even integer. In the study of variational problems in $W^{1, p}$, it is handy to know that for $a, b \in \mathbb R^d$, $$|a - b|^p \leq 2^{p - 1} (|a|^{p - 2} + |b|^{p - 2}) |a - ...
Aidan Backus's user avatar
0 votes
1 answer
66 views

Correct conditions for the image of a matrix to intersect a cone?

Given an $m \times n$ real (or rational) matrix $A = (a_{ij})$, what are necessary and sufficient conditions for the image of this matrix to intersect a cone? I am specifically interested in the cone $...
LGe's user avatar
  • 11
1 vote
0 answers
40 views

Bound of entries of inverse of a unimodular matrix whose row sum is bounded

Many questions have been asked about the bound of the entries of the inverse of a matrix subject to certain conditions. Here my condition is slightly different: let $A=(a_{ij})$ be an $n \times n$ ...
oleout's user avatar
  • 895
10 votes
3 answers
455 views

When does $\det(\frac{A+A^T}{2})=\det(A)$ for positive-definite $\frac{A+A^T}{2}$?

Setup: Let $A$ be a real square matrix and assume its symmetric part $\frac{A+A^T}{2}$ is positive-definite. The inequality $$ \det\left(\frac{A+A^T}{2}\right) \leq \lvert\det(A)\rvert $$ is known as ...
Aditya Bandekar's user avatar
6 votes
1 answer
127 views

Intersection of integral points with a unipotent and its opposite

This is a follow-up to Does the bruhat decomposition induces decomposition on integral points (on an open cell)? Given a split connected reductive group $G$ over a $p$-adic local field $F$ with ring ...
Ashwin Iyengar's user avatar
1 vote
0 answers
80 views

Moments from characteristic function for matrices

When $x$ is a random variable with the smooth characteristic function $\phi_x(t) = \mathbb{E}e^{itx}$, we can easily compute the moments as $\mathbb{E}[x^k] = i^{-n}\phi_x^{(n)}(0)$. There is no magic ...
user3826143's user avatar
13 votes
0 answers
188 views

Why is $ULU=NU$ (a refinement of $|N|=q^{n^2-n}$)?

Let $G=GL_n(\mathbb{F}_q)$, $U$, $L$, $N$ the subsets of upper-triangular unipotent, lower-triangular unipotent, all unipotent matrices respectively. Then $ULU=NU$ means that for any $g\in G$ the ...
Anton Mellit's user avatar
  • 3,772
2 votes
0 answers
71 views

Lexicographically largest incidence matrix

I have simple algorithmic question, but I can't find any source where this algorithm is explained in details. Let's assume that we have incidence (with 0 and 1 values) matrix of size $m\times n$. Let ...
Ihromant's user avatar
  • 501
0 votes
0 answers
43 views

Absolute value of elements of b=Ax and the minimum singular value of A

For $b=Ax$, is there a way to relate the minimum absolute value of the element of $b$, $\min|b_i|$, and the minimum singular value, $\sigma_\text{min}$, of $A$? What I want is something like: $\sigma_\...
William Lin's user avatar
1 vote
0 answers
134 views

Number of ways to place 4 kings on nxn chessboard

I have a $n\times n$ chessboard and 4 kings inside it. My goal is to count the number of arrangements where some of them are non-attacking or mutually attacking, for example: In the case where the $4$...
Cardstdani's user avatar
1 vote
1 answer
391 views

How one can show that this matrix is full rank?

Fix $d\in\mathbb{N}$ and consider $e_{i,j}\in\mathbb{C}$ for $i=1,\dots,d+3$ and $j=1,\dots,d-1$. Suppose to have the following matrices $$N_{i,1}=\begin{pmatrix} 1 & 0 \\ e_{i,1} & 1 \end{...
Stefano's user avatar
  • 11
7 votes
0 answers
131 views

Approximation of a continuous curve on commuting matrices

I have a continuous curve $A:\mathbf{R}_+\rightarrow \text{M}_N(\mathbf{R})$ such that $[A(t),A(s)] \operatorname*{\longrightarrow}_{t,s\rightarrow +\infty} 0$, where $[A(t),A(s)] = A(t)A(s)-A(s)A(t)$....
Ayman Moussa's user avatar
  • 3,425
3 votes
2 answers
197 views

Proper Latin sub-squares of generalized Latin squares

Say we have a generalization of a Latin square, where the square is of size $n \times n$, $n = ab$ and each row and each column has $b$ occurrences of each of $[1, \dots, a]$. Is there always ...
user531465's user avatar
0 votes
0 answers
44 views

The eigenvalues of tridiagonal matrices

Can we determine the number of positive eigenvalues for the following tridiagonal matrix under some criterion in terms of $a_i,b_i,c_i$: $$ A_n= \begin{pmatrix} a_{1} & b_{1} \\\ c_{1} & a_{2}...
user1150713's user avatar
3 votes
0 answers
109 views

How much a general a theory of matrices equivalence under group actions we have?

Let $F$ be a field and let $M_{m,n}\,(F)$ be the $F$-linear space of $m \times n$ matrices over $F$. Let $G$ be a group acting on $M_{m,n}\,(F)$. My question is: Do we have some theory about the ...
en-drix's user avatar
  • 157
0 votes
0 answers
32 views

Finding measure representation for rank 2 moment matrices

Assuming the following equation has a solution, I'm interested in finding any concrete values of $x_{1},\dots x_{n},y_{1},\dots y_{n},c_{1},c_{2},R$ that fulfills it. $$ \begin{bmatrix} 1 & 1 \\ ...
patchouli's user avatar
  • 275
0 votes
0 answers
101 views

Eigenvectors of tridiagonal hermitian matrix

In my paper, I investigate the coordinates of the eigenvectors of a hollow tridiagonal hermitian matrix, which is defined as: \begin{align*} Q_n = \begin{pmatrix} 0 & q_{1,2} & 0 & 0 & ...
Denis's user avatar
  • 1
0 votes
1 answer
45 views

Expectation of spectral norm of a diagonal stochastic matrix

There is a diagonal matrix $G(t)\in R^{M\times M}$ where the diagonal elements are independent Bernoulli stochastic variables, satisfying $\mathbb{E}(g_i(t) = 1) = b$, and $ \mathbb{E}(g_i(t) = 0) = 1 ...
Keven Sun's user avatar
7 votes
2 answers
200 views

When is a linear isomorphism of $M_n(\mathbb{C})$ given by unitary conjugation?

Let $M_n(\mathbb{C})$ represent the space of $n \times n$ matrices over $\mathbb{C}$. We will think of it as a $\mathbb{C}$-vector space. Notice that if $A \in M_n(\mathbb{C})$ is invertible, then the ...
Rahul Sarkar's user avatar
5 votes
2 answers
392 views

Maximal eigenvalue of a real symmetric Toeplitz matrix

The $n×n$ matrix $A_n$ is defined by the elements $a_{ij}=n−|i−j|$. \begin{bmatrix} n & n-1 & n-2 & \cdots & 1\\ n-1 & n & n-1 & \cdots & 2\\ n-2 & n-1 & n &...
Drophet's user avatar
  • 61
7 votes
1 answer
270 views

Existence of a linear map resulting in the determinant being an elementary symmetric polynomial

Let $1 \leq k \leq n$ be fixed integers. Let $\mathcal{M}_n^{\mathrm{H}}$ be the set of $n \times n$ complex Hermitian matrices (if it makes it easier to answer this question, you may instead use the ...
Nathaniel Johnston's user avatar
2 votes
0 answers
160 views

An "almost" true inequality for Hermitian matrices

Let $A$ be an $N\times N$ Hermitian matrix. For $p+q$ even, consider the following inequality: $$\frac{1}{N}\sum_{i=1}^N (A^p)_{ii} (A^q)_{ii} \geq \Big(\frac{1}{N}\sum_{i=1}^N (A^p)_{ii} \Big) \Big(\...
WunderNatur's user avatar
6 votes
0 answers
130 views

Bent vectors and $\pm 1$ eigenvectors with respect to non-Sylvester Hadamard matrices

A Hadamard matrix is an $n\times n$-matrix $H$ where each entry in $H$ is $\pm 1$ and where $H/\sqrt{n}$ is orthogonal. It is well-known that if $H$ is an $n\times n$-Hadamard matrix, then $n<3$ or ...
Joseph Van Name's user avatar
7 votes
1 answer
388 views

Questions on symmetric Hadamard matrices

Definitions: An $n\times n$ Hadamard matrix (HM for short) is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal. If $A$ is a symmetric matrix, then $A = A^T$ and if $...
user369335's user avatar
2 votes
0 answers
78 views

Partitions of bent vectors

Let $H=\frac{1}{\sqrt{2}}\begin{bmatrix}1 & 1 \\ 1 & -1\end{bmatrix}.$ Let $A^{\otimes N}$ denote the tensor product of the matrix $A$ with itself taken $N$ times. We say that a vector $v$ of ...
Joseph Van Name's user avatar
6 votes
0 answers
111 views

Factorization to sparse matrices

$\newcommand{\lrank}{\operatorname{lrank}}$ $\newcommand{\rank}{\operatorname{rank}}$ Given a matrix $A$, we can define its Hamming weight, $w(A)$, as the number of non-zero elements in it. Now, given ...
Daniel Weber's user avatar
  • 3,319
2 votes
1 answer
157 views

Under row operations and column permutations a matrix A can be put in the non-unique form ( I | X ), what is known about the set of possible X?

Given a full row-rank matrix $A$, this can be put into a unique reduced row echelon form via elementary row operations. Allow column permutations (no column addition / multiplication) and this can be ...
DeafIdiotGod's user avatar
4 votes
1 answer
132 views

Reference request for Bessel function of the second kind with matrix argument

As the title says, I would like to know if anyone could provide a reference which provides the definition and properties of the Bessel function of the second kind with matrix argument. If possible, I ...
learner123's user avatar
9 votes
2 answers
244 views

Matrix invariants for simultaneous conjugation by a finite subgroup of $\textrm{GL}_n$

Let $K$ be a field of characteristic 0, and consider $d$ generic $n\times n$ matrices $X_1,\ldots,X_d$ where $X_k = (x_{ijk})_{ij}$ and $ K[x_{ijk}]$ is the polynomial algebra in $n^2 \cdot d$ ...
Greg Zitelli's user avatar
  • 1,084
0 votes
0 answers
72 views

Minimizing the Spectral Norm of the Hadamard Product of a Quadratic Form Using CVX

I am trying to use CVX to minimize the spectral norm of the Hadamard product of two matrices, one of which is in quadratic form. Specifically, I am trying to minimize $\|{\bf A} \odot {\bf XX}^H\|_2$, ...
usergh's user avatar
  • 43
2 votes
0 answers
117 views

A very specific quotient of a determinantal variety

I'm interesting in knowing whether a certain variety defined by maximal minors is irreducible. The specific construction is as follows: let $n \geq 2$ and let $R = \mathbb{C}[a_1,b_1,c_1,d_1,e_1,f_1,...
Jon Elmer's user avatar
  • 185
2 votes
0 answers
148 views

Nilpotent polynomial matrices over $F_q$ - polynomial count variety ? ( Nilpotent cone for Hitchin-Gaudin like integrable system)

Context: Number of nilpotent $n\times n $ matrices over $F_q$ is $q^{n(n-1)}$ classical result due to Ph.Hall, M.Gerstenhaber (see very nice exposition by T.Leinster at n-cat-cafe/arxiv) which have ...
Alexander Chervov's user avatar
1 vote
0 answers
63 views

Reference request for non-banded Toeplitz matrix

I want to know references that treat the property of eigenvalues and eigenstates of the non-banded Toeplitz matrix. I mean for example, the Toeplitz matrix $A$ whose matrix element is given by $A_{ij}=...
hos's user avatar
  • 11
1 vote
1 answer
67 views

Low rank matrices which preserve maximizers of quadratic form

Suppose $x, y \in \{0,1\}^d$ are binary vectors. For a matrix $M$ consider the quadratic form, \begin{align} x^T M y + (\mathbb{1} - x)^T M (\mathbb{1} - y) \end{align} Does there exist an $M$ such ...
Television's user avatar
1 vote
0 answers
77 views

$M^2=0$ defines a Koszul algebra ? What if $M$ is Manin's endomorphism's of Koszul $A$ ? (Here $M^2=\sum_k M_{ik}M_{kj}$ - resembles $d^2=0$).)

Consider a matrix $M$ which elements $M_{ij}$ are generators of some algebra $K$, impose new relations: $M^2=0$ and get a new algebra $K_{2}$. Question 1: Is it true that $K_2$ is Koszul algebra when ...
Alexander Chervov's user avatar
1 vote
0 answers
45 views

Rank of Hadamard product of column-wise polynomial evaluations and row-wise exponential evaluations

Consider the Hadamard product $A \odot B$ between two special matrices $A,B \in \mathbb{R}^{n \times m}$. The columns of $A$ are evaluations of polynomials, while the rows of $B$ are evaluations of ...
user31127's user avatar
0 votes
0 answers
36 views

Conjugate gradient-like algorithm with multiple search directions

I am solving an $n*n$ system $Ax=b$ in CUDA where $A$ is a sparse matrix. Currently I am solving it using the conjugate gradient algorithm. I have noticed that $Ax$ where $x$ is $n*1$ has roughly the ...
SRB121's user avatar
  • 71
2 votes
1 answer
345 views

What's the explicit value of this determinant

Let $n\ge2$ be a positive integer, and let $b_1,\cdots,b_n, c_1,\cdots, c_n$ be variables. Recently, I met the following determinant: $$\det A=\left|\begin{array}{cccc} 1 & b_1+c_1 & b_1^2+c_1^...
Beginner's user avatar
0 votes
0 answers
61 views

Combinatorial counting question related to count (anti)commuting N-tuples of matrices (more generally $(X_1,...X_n): F(X_i,X_j)=0$ - only one F)

Consider some finite set $S$ (can be matrices over $F_p$), consider some symmetric relation $F(s1,s2)$ which values are True or False (for example - matrices (anti)commutate or not). Question 1: can ...
Alexander Chervov's user avatar
0 votes
0 answers
66 views

Random elliptical potential lemma

Elliptical Potential Lemma: Let $V_0 \in \mathbb{R}^{d \times d}$ be positive definite and $a_1,a_2,...,a_n \in \mathbb{R}^{d}$ be a sequence of vectors with $||a_t ||_2 \leq L < \infty$ for all $t ...
Mixi Andrew's user avatar
1 vote
1 answer
293 views

Nearest Kronecker product to sum of Kronecker products

I am interested in efficiently finding the closest Kronecker decomposition to the sum of $k$ Kronecker products: $$\min_{A,B} || A \otimes B - \sum_{i=1}^k A_i \otimes B_i ||_F$$ where $A,A_i$ are $p \...
Daniel's user avatar
  • 111
0 votes
1 answer
127 views

update rule for the inverse after a rank-1 update plus scaled identity

Is there an update rule for $$\left(\tilde{X}^T\tilde{X}+\alpha\cdot I\right)^{-1}$$ with $\tilde{X}=[X\;\; a]$ as a function of $A\triangleq (X^TX)^{-1}$, $X$ and $a$? I know that when $\alpha=0$ we ...
Student88's user avatar
  • 503
3 votes
2 answers
447 views

Guess the next polynoms in the sequence (MO vs. AI :), count anticommuting $F_p$-matrices, P. Hrubeš conjecture

Here is a sequence of polynoms - (presumably) counting N-tuples of ANTI-commuting 2x2 matrices over $F_p, p>2$. (That is just the case of 2x2 matrices, and (surprisingly) it is not so easy to see a ...
Alexander Chervov's user avatar
7 votes
1 answer
238 views

Hadamard product decomposition with lower rank matrices

Given integers $k$ and $l$ and a matrix $A$ of rank $kl$, can we always find a matrix $B$ of rank $k$ and a matrix $C$ of rank $l$, such that $A$ is the Hadamard product of $B$ and $C$, namely $A=B \...
Yuchen He's user avatar
0 votes
0 answers
33 views

determinantal ideal of sum of Galois conjugate matrices

Given $n$ matrices $A_i \in \mathbb{Z}^{m\times m}$. I am interested in the ideal $I_d(A)$ generated by the $d\times d$-minors of $A = \sum_{i=1}^n x_iA_i \in \mathbb{Z}[x_1, \dots , x_n]$. The matrix ...
MatthysJ's user avatar
2 votes
0 answers
85 views

Smallest eigenvalue of certain PD matrix decreases under sparse perturbation

Let $\omega_1<\dots<\omega_n\in\mathbb{R}$. Then, define $G\in\mathbb{C}^{n\times n}$ such that $G_{k\ell}=\frac{1}{1-i(\omega_\ell-\omega_k)}$. For example, if $n=3$ we obtain $$ G=\begin{...
PIII's user avatar
  • 83
3 votes
1 answer
343 views

Reference request: about “SNF” (Smith Normal Form)

I've read about some studies on the Paley I Construction. Among them I found the following notations ( See this page: https://documents.uow.edu.au/~jennie/matrices/32P02.html ). $$SNF:1,2^a,4^{b},8^{b}...
Matthers's user avatar
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

1
2
3 4 5
65