Skip to main content

All Questions

Filter by
Sorted by
Tagged with
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)...
Emerick's user avatar
  • 153
1 vote
0 answers
110 views

Multiplication of a matrix by sub-matrices

I have a $J \times J$ matrix $C$ that is upper triangular. Also, $C'C$ is positive definite. I also have a matrix $A$ formed by submatrices of size $J \times K$ as follows $$ A = \begin{bmatrix} A_1 \\...
LauraH's user avatar
  • 11
0 votes
1 answer
135 views

On polynomial equation of fourth order depending on two parameters and bound on a maximal root

I would like to apologize in advance for a too technical question. Let us consider the following fourth order polynomial equation in $x$: \begin{eqnarray} F(x) \equiv (2 a p +2)x^4+ (6a(1-a)p^...
Vladimir's user avatar
  • 371
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
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
0 votes
0 answers
77 views

Eigenvalues of N×N correlation matrices as N tends to infinity

I want to find a 𝑁×𝑁 positive definite correlation matrix, which ensures that as 𝑁 goes to infinity, only a finite number of eigenvalues remain non-zero, while the rest eigenvalues approach zero. ...
Zywoo_biu's user avatar
3 votes
1 answer
87 views

Low rank perturbation of non-Hermitian $A$, where all eigenvalues are real

Suppose $A,E$ are Hermitian $(n \times n)$-matrices and $E$ is of low rank. There are well known results bounding the difference in spectra of $A$ and $A+E$. For example the Eigenvalue Interlacing ...
Ben Deitmar's user avatar
  • 1,295
3 votes
1 answer
547 views

Why is this polynomial factorizable? [closed]

I met a curious problem on factorizing a homogenerous polynomial of degree 9. Problem: Show that the following polynomial can be divided by $(a_1+a_2+a_3)$: \begin{align} &\quad\left| \begin{array}...
LichenSDU's user avatar
  • 357
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
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
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]_{...
Zhi-Wei Sun's user avatar
  • 15.6k
4 votes
1 answer
250 views

Does a generic linear map admit a vector whose iterates span $V$?

We say a linear map $T$ on a finite dimensional vector space $V$ admits spanning vectors if there exists some vector $v \in V$ whose iterates $v, Tv, T^2 v, \dots$ under $T$ span $V$. Question: ...
Nate River's user avatar
  • 6,215
1 vote
0 answers
39 views

Constructing a centered distribution absolutely continuous with respect to uniform measure on the sphere with a pre-specified covariance?

Let $\mathcal{K}_n$ denote the space of $n \times n$, real symmetric positive semidefinite matrices $K$ having unit trace. It is easy to verify that for each $K \in \mathcal{K}_n$, there exists a ...
Drew Brady's user avatar
7 votes
1 answer
894 views

Logical strength of a statement about vector spaces

[Apologies if this is a really trivial question, I know virtually nothing about set theory, and the following came up while preparing undergraduate linear algebra lectures.] I'm asking about the ...
David Loeffler's user avatar
3 votes
1 answer
210 views

Exponential growth of shortest vector norm for successive lattices corresponding to powers of a matrix

Let $A\in M_{2\times 2}(\mathbb{Z}) $ be a two by two integer matrix such that $0,\pm 1$ are not eigenvalues of $A$ and $\left|\det(A)\right|>1$. I am interested in the growth of the norm shortest ...
an_ordinary_mathematician's user avatar
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 = ...
Ben Deitmar's user avatar
  • 1,295
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
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
13 votes
2 answers
730 views

Concrete representation of coend in linear algebra

$\require{AMScd}$Teaching coend calculus to a PhD student led me to this "elementary" computation that I would like to perform explicitly. Consider the functor $F : (\mathbb N,\le)^\text{op}\...
fosco's user avatar
  • 13.6k
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{...
Zhi-Wei Sun's user avatar
  • 15.6k
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
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?
rick's user avatar
  • 199
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 ...
Shock Captor's user avatar
4 votes
0 answers
87 views

Non-zero element in diagonal of cofactor matrix of symmetric 0-1 matrix with non-zero determinant, zero diagonal and odd number of rows

Is the following statement correct? Let $A$ be a symmetric 0-1 matrix with non-zero determinant, all diagonal elements equal to 0 and an odd number of rows. The diagonal of the cofactor matrix of $A$ ...
user528497's user avatar
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
109 votes
15 answers
12k views

Why are matrices ubiquitous but hypermatrices rare?

I am puzzled by the amazing utility and therefore ubiquity of two-dimensional matrices in comparison to the relative paucity of multidimensional arrays of numbers, hypermatrices. Of course ...
Joseph O'Rourke's user avatar
5 votes
1 answer
167 views

Upper bound for the $n$-th derivative of a rational function $\frac{f}{f+g}$

Let $f$ and $g$ be real polynomials with nonnegative coefficients. Let $$ h = \frac{f}{f+g}. $$ I want to prove that the $n$-th derivative of $h$ satisfies: There exists $C > 0$ such that $$ |h^{(...
xen's user avatar
  • 187
15 votes
3 answers
1k views

Group of matrices in which every matrix is similar to unitary

$\DeclareMathOperator\GL{GL}$Let $G$ be a subgroup of $\GL_n(\mathbb{C})$ such that for every $g \in G$ there exists $c \in \GL_n(\mathbb{C})$ for which $cgc^{-1}$ is unitary (or, which is the same, $...
Александр Худяков's user avatar
12 votes
3 answers
784 views

Can the equation $1+z+z^2=z^n$ for natural $n$ have multiple complex roots $z$?

The question is stated in the title of this post. It is easy to see that, if $z$ is a multiple root of $p_n(z):=1+z+z^2-z^n$, then $(n-2)z^2+(n-1)z+n=0$, so that we can successively express $z^2,\dots,...
Iosif Pinelis's user avatar
12 votes
1 answer
902 views

Positive 4-form

Denote by $W$ the space of all symmetric bilinear forms on $\mathbb{R}^n$. Let $Q$ be a quadratic form on $W$. Suppose that $Q(b)\geqslant 0$ for any $b\in W$ such that $b(X,Y)=\ell(X)\cdot\ell(Y)$ ...
Anton Petrunin's user avatar
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 ...
lunch zheng's user avatar
0 votes
1 answer
170 views

Isn't every algebraic operad equipped with a trivial weight?

In Loday–Vallette "Algebraic Operads" they state the following result (Theorem 6.6.2, Operadic twisting morphism fundamental theorem): Let $P$ be a connected weight graded differential ...
groupoid's user avatar
  • 215
238 votes
10 answers
43k views

If $f$ is infinitely differentiable then $f$ coincides with a polynomial

Let $f$ be an infinitely differentiable function on $[0,1]$ and suppose that for each $x \in [0,1]$ there is an integer $n \in \mathbb{N}$ such that $f^{(n)}(x)=0$. Then does $f$ coincide on $[0,1]$ ...
C.S.'s user avatar
  • 4,795
2 votes
0 answers
67 views

Characteristics of conjugate gradients' iterations for a matrix with clustered spectrum

I am interested in solving \begin{equation} Ax = b \end{equation} for a large sparse linear symmetric positive definite matrix $A$ by Conjugate Gradients method. (These systems usually come as ...
Korf's user avatar
  • 121
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
2 votes
1 answer
247 views

Linear system with matrix as a variable

I have the following two linear systems: $$\begin{bmatrix} u_{11} & u_{12} \end{bmatrix} A = 0$$ $$\begin{bmatrix} u_{21} & u_{22} \end{bmatrix} B = 0$$ Both $A,B$ are $2 \times 2$ matrices ...
NYG's user avatar
  • 129
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
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
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 ...
Pierre's user avatar
  • 2,287
3 votes
2 answers
215 views

Is there a closed-form solution for $\max_D \operatorname{Tr}(ADBD)$

Is there a closed-form solution for $$\max_D \operatorname{Tr}(ADBD)$$ where $D$ is a $N\times N$ diagonal matrix with $m<N$ number of $1$'s and the rest are $0$'s, and $A$ and $B$ are real ...
CWC's user avatar
  • 433
6 votes
1 answer
1k views

Full expansion of $\det(I+\varepsilon A)$

It is well known that given a $n \times n$ matrix $A$, it holds that $$ \det(I + \varepsilon A)= 1 + \varepsilon \operatorname{tr}(A) + O(\varepsilon ^2).$$ I would need a full representation of $ \...
tommy1996q's user avatar
91 votes
19 answers
20k views

Injectivity implies surjectivity

In some circumstances, an injective (one-to-one) map is automatically surjective (onto). For example, Set theory An injective map between two finite sets with the same cardinality is surjective. ...
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 \...
Daniel's user avatar
  • 111
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 ...
Guest2024bis's user avatar
1 vote
0 answers
40 views

From a constraint satisfaction problem (CSP) to a sudoku grid [closed]

one of the existing methods of solvin a sudoku grid is via constraints satisfaction (CSP), but can we do the inverse ie convert a CSP problem into a sudoku grid and then solve it ?
youssef Lmourabite's user avatar
9 votes
2 answers
954 views

Direct proof of unique invariant distribution for ergodic, positive-recurrent Markov chain

I posted the following question on MSE, feeling that it perhaps isn't research level mathematics, but didn't get any bites. So, I am crossposting here. The following ergodic theorem is well known. ...
user24601's user avatar
  • 165
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 ...
respectableuser1's user avatar
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 ...
mr bean's user avatar
  • 11
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 ...
ZZZZZZ's user avatar
  • 33
1 vote
1 answer
205 views

Van der Waerden conjecture and Alexandrov-Fenchel inequality

The Van der Waerden conjecture is a lower estimate of the permanent of a doubly stochastic matrix. In this article in Wikipedia it is stated that Egorychev's proof uses the Alexandrov-Fenchel ...
asv's user avatar
  • 21.8k

1
3 4
5
6 7
121