All Questions
6,178 questions
2
votes
1
answer
187
views
Maximum of $\sum_{n=1}^N z^T X(P_n X + I)^{-1}z$ over unit trace, positive semidefinite matrices?
Let $z$ denote a unit vector.
Fix a finite collection of positive semidefinite matrices $\mathcal{P}$.
Define the function and set
$$
f_{\mathcal{P}}(X) = \sum_{P \in \mathcal{P}} z^T X(PX + I)^{-1} z,...
1
vote
1
answer
87
views
Where does $V$ from the spectral decomposition $A = VDV^*$ lie, if $A$ has only imaginary entries?
The spectral theorem says that for every Hermitian matrix $A \in \mathbb{C}^{n \times n}$ there is a unitary matrix $V \in U(n)$ and a diagonal matrix $D \in \mathbb{R}^{n \times n}$ such that $A = ...
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$, ...
1
vote
0
answers
37
views
Bounding the length of an R-module of matrices
Loosely related to this: Bounding the length in a module of evaluated skew polynomials
Let $C$ be an $\mathbb{F}_q$-vector subspace of $m \times n$ matrices over $\mathbb{F}_q$. Assume WLOG that $m \...
1
vote
0
answers
50
views
Interpolation in convex hull
I'm reading a paper, Learning in High Dimension Always Amounts to Extrapolation, that provides a result I don't understand.
It provides this theorem which I do understand:
Theorem 1: (Bárány and ...
3
votes
2
answers
251
views
Minimum-norm solution of $A = X B + B^T X^T$
Let $A, B, X$ be invertible square matrices, and let $A$ additionally be symmetric. I'd like to solve the following minimization problem:
$$\text{argmin}_X |\!| X |\!|_F \ \ \ \ \text{s.t.} \ \ \ \ A =...
4
votes
1
answer
341
views
rank of an integer valued matrix
I make some numerical experiments, involving rank of integer valued matrices of the size about $14\times 24$. As the matrix is integer valued, theoretically there should be no room for errors. However ...
0
votes
0
answers
38
views
Sequence of projections that alters a $2^d$ tuple of points to a hyperparallelepiped
Suppose we have a $2^d$ tuple $\{ x_i \}_{i=0}^{2^d-1}$ of points in some $\mathbb{R}^n$. I would like to shift the points of this tuple in some controlled way, so that the final $2^d$ tuple $\{ y_i \}...
1
vote
0
answers
64
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}=...
3
votes
0
answers
153
views
Categorification of a vector space such that a functor between these is a linear map?
A functor between two monoids seen as 1 object categories is essentially a monoid-homomorphism. What is the equivalent construction for vector spaces and linear maps?
1
vote
0
answers
66
views
Characterising lattices $\Lambda\subseteq\mathbb{Z}^n$ whose union of translations by $b\in\{0,1\}^n$ recovers $\mathbb{Z}^n$
Given a lattice $\Lambda\subseteq\mathbb{Z}^n$ defined by $\Lambda = \{ Mx : x\in\mathbb{Z}^n \}$, let $\Lambda_b$ for $b\in \{0,1\}^n = B$ be the translation of $\Lambda$ by $b$. Call $M$ special ...
5
votes
1
answer
196
views
What is the "natural" or "physical" norm on the Hessian matrix (and other higher derivatives)?
Let $u : \mathbb R^n \rightarrow \mathbb R$ and let $H : \mathbb R^n \rightarrow \mathbb R^{n \times n}$ be its Hessian matrix. What is the "natural" choice of pointwise norm on the Hessian ...
1
vote
0
answers
60
views
Bounding the length in a module of evaluated skew polynomials
Let $R$ be a finite principal ideal ring, $S$ a Galois extension of $R$ of degree $m$ (so in particular $S$ is a free $R$-module of rank $m$, and we have an $R$-module isomorphism $S^n \cong \...
6
votes
1
answer
244
views
Linear independence over field of rational functions
To prove that functions $f_1(x), \dots, f_n(x)$ with $x \in \mathbb R$ are linearly independent, we only need to show that the Wronskian of these functions is non-zero at a certain value of $x$. Now ...
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 ...
4
votes
0
answers
108
views
Larger possible chain of closed subspaces in the dual of a Banach space
In this question, is demonstrated that a separable space can have a chain (ordered by inclusion) of closed subspaces with uncountable many subspaces.
My question is the following. If $X$ is an ...
1
vote
0
answers
195
views
Conjectural values of some determinants involving Legendre symbols (II)
Let $p$ be an odd prime, and let $(\frac{\cdot}p)$ denote the Legendre symbol. Motivated by the evaluation of the determinants
$$\det\left[\left(\frac{j+k}p\right)\right]_{1\le j,k\le(p-1)/2}\ \ \text{...
0
votes
0
answers
123
views
Realizable singular value spectra of normalized finite frames
$\DeclareMathOperator\tr{tr}$Let $m, n \in \mathbb{N}$, $m \geq n$, and let $\{f_i\}$, $1 \leq i \leq m$, be $m$ unit vectors (wrt. 2-norm) in $\mathbb{R}^n$. Let $A = [f_1 \, \, \, f_2 \, \, \, \...
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 ...
0
votes
1
answer
60
views
Symmetric positive definite matrix - submatrices
Let $\lambda$ and $\Lambda$ be two fixed positive numbers and let $A$ be a symmetric real matrix with $\lambda |x|^2 \leq (Ax,x) \leq \Lambda |x|^2$.
Let $B$ be a matrix derived from $A$ as follows: $...
0
votes
1
answer
317
views
A variation of the Riesz Lemma
Given a normed space $X$, a closed proper subspace $Y$ and $\alpha\in (0,1)$, the Riesz Lemma states that there is $x\in X$ such that $\|x\|=1$ and $d(x,Y)>\alpha$. Observe that also $d(-x,Y)=d(x,Y)...
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^...
1
vote
0
answers
189
views
The existence of solutions to linear systems of equations over the integer ring $\mathbb{Z}$
There are already detailed results on the solutions of linear equations over fields, but I'd like to inquire about any good conclusions regarding the solutions of linear equations over the integer ...
3
votes
4
answers
551
views
How big a class of lines can a non-linear transformation map to itself?
Edit: In the original version of this question, I wrote "lines through the origin" instead of "lines"; as Alexandre Eremenko points out in his answer, this makes the question too ...
4
votes
0
answers
238
views
Conjectural values of some determinants involving Legendre symbols (I)
$\newcommand\Legendre{\genfrac(){}{}}$Let $p$ be an odd prime, and let $\Legendre\cdot p$ be the Legendre symbol. In 2003, Robin Chapman evaluated the determinants
$$\det\left[\Legendre{i+j}p\right]_{...
0
votes
0
answers
47
views
Counting zero-sum subsets of a finite field with a particular form
Let $\mathbb{F}$ be a finite prime field of characteristic different than $2$ and $\beta \in \mathbb{F}$ a generator of the $2$-power order multiplicative subgroup of order $2^k$, so $\beta^{2^{k-1}} =...
0
votes
1
answer
100
views
Projection on a countable union of linear subspace
For any natural number $n$, $V_n$ denotes a closed linear subspace of a $L_2(m)$ space, which is an Hilbert Space, where $m$ denotes a finite measure. Moreover $(V_n)$ is increasing, that is $V_n$ is ...
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 ...
1
vote
1
answer
297
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 \...
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 ...
3
votes
2
answers
452
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 ...
0
votes
0
answers
28
views
Example of a matrix -HDH that is not PSD (with non-euclidean distances D)
It's widely known that, given a matrix of squared Euclidean distances, $\mathbf{D}_{ij} = \| \mathbf{X}_i - \mathbf{X}_j \|^2$, and the centering matrix $\mathbf{H} = \mathbf{I} - \dfrac{1}{n}11^T$, ...
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 \...
2
votes
0
answers
80
views
Inequality involving minors of an orthogonal matrix
Fix $n \geq 3$ and take any orthonormal vectors $x,y,z \in \mathbb{R}^n$. Let also $A \in M_n(\mathbb{R})$ be a symmetric matrix with positive entries ($A_{ij} = A_{ji} > 0$). Is the following ...
2
votes
1
answer
170
views
Equivalence of minimizing trace and determinant over matrix quadratic form in multivariate regression
Consider the multivariate regression model
$$Y = XB + E$$
where $Y$ is $n \times p$ and corresponds to the dependent variables, $X$ is $n \times k$ and corresponds to the independent variables, $B$ is ...
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 ...
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{...
1
vote
1
answer
125
views
Integrability of modified diagonalizable Jacobian
I have a smooth function $f$ from $\mathbf{R}^N$ to $\mathbf{R}^N$. For each $x\in \mathbf{R}^N$ the Jacobian of $f$, $J_f$, is diagonalizable as
$$
J_f(x)=S(x)\Lambda(x) {S(x)}^{-1},
$$
where the ...
5
votes
3
answers
560
views
An inequality in an Euclidean space
For $n\geq 1$, endow $\mathbb{R}^n$ with the usual scalar product. Let $u=(1,1,\dots,1)\in\mathbb{R}^n$, $v\in {]0,+\infty[^n}$ and denote by $p_{u^\perp}$ and $p_{v^\perp}$ the orthographic ...
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$...
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 ...
0
votes
2
answers
396
views
How to show the following matrix has eigenvalues $-d,-d+1,...,d$?
Consider the following $(2d+1)\times (2d+1)$ matrix:
$$
A = \begin{pmatrix}
0 &\frac{2d}{2} & 0 &0 & \cdots &0 & 0 \\
\frac{1}{2} & 0 & \frac{2d-1}{2} &0& \...
1
vote
1
answer
99
views
Maximum column norm of random $A^{-1}B$
Suppose that $A$ is an $n$ by $n$ Gaussian matrix (each component i.i.d. normal distributed with mean 0 and variance 1). Let $b$ be a $n$-Gaussian vector. Then it could be easily proven that the ...
7
votes
0
answers
225
views
Decomposing an endomorphism as a tensor product
$\DeclareMathOperator\End{End}$Let $f$ be an endomorphism of the finite-dimensional vector space $V$, over the field $K$. The question of whether $f$ is decomposable, that is, whether $V$ can be ...
0
votes
0
answers
36
views
A class of directed graph, when their minimal polynomial of the adjacency matrix matches the characteristic polynomial
We consider an unweighted directed simple graph, $G$, with a Hamiltonian cycle.
Q. Assume that the adjacency matrix of $G$ is non-singular. Do the characteristic and minimal polynomials of the ...
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 ...
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}...
0
votes
0
answers
68
views
Meaning of $\langle M,\,M^{-1}\rangle$
For an $n\times n$ complex matrix $M$, is there a name for the expression $\langle M,\,M^{-1}\rangle$, where the inner product is the Frobenius one, $\langle A,\,B\rangle=\text{tr}(A^*B)$? Is there a ...
3
votes
0
answers
106
views
Bijectivity of a linear map between symmetric polynomials of even degree
Let $\mathfrak S_n$ be the symmetric group of permutations of $n$
letters and let $S = \sum_{\sigma\in\mathfrak S_n} \sigma$ be the
symmetrization operator.
Let $\Lambda_n^r$ be the vector space of ...
0
votes
0
answers
55
views
Johnson-Lindenstrauss type result for matrix factorization
The type of result I want is: given matrix $A\in \mathbb{R}^{m\times n}$ and error tolerance $\epsilon$, what is a lower bound on $k$ such that $\|A - UV\|_{??}\le \epsilon$, where $U \in\mathbb{R}^{m\...