All Questions
1,923 questions with no upvoted or accepted answers
0
votes
0
answers
84
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)...
0
votes
0
answers
67
views
Concentration of bilinear forms
This is a bit vague so I'll begin by indicating the motivation. I am looking for ways to [do something interesting or useful] with the self-attention in transformer models. Ultimately the self-...
0
votes
0
answers
185
views
Degree 6 Galois extension over $\mathbb{Q} $
Let L be the splitting field of $ x^3- 2$ over $ \mathbb{Q}$. Then $ G=\operatorname{Gal}(L/K) \cong S_3$. Let $\sigma\in G$ such that the fixed field of $ \sigma$ is $\mathbb{Q}(2^{1/3})$. Let $x,y\...
0
votes
0
answers
81
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 ...
0
votes
0
answers
30
views
Application of greedy approach for optimization
I want to maximize an objective given by $$\max_{\{q_n,p_n\}} \sum_{n=0}^\infty (\alpha_1 - \beta_1 n) p_n + (\alpha_2 - \beta_2 n) q_n$$
where $\alpha_1 > \beta_1 >0$ and $\alpha_2 > \beta_2 ...
0
votes
0
answers
108
views
Generalization of SVD algorithm
Let $K$ be a field, $A\in K^{n\times m}$ and $\lVert \cdot \rVert$ the Euclidean norm. Consider the problem: Find a $v\in K^m$ such that
\begin{align}
\lVert Av\rVert=\min_{\lVert x\rVert=1}\lVert Ax\...
0
votes
0
answers
28
views
The selection of minimal generating sets in Lie algebra
Suppose $A$ is a Lie algebra on field $F_{p}$ with $[A,A,A]=0$. Denote $\{a_{1},\cdots,a_{d}\}$ is a minimal generating set of $A$.It's possible that $[a_{i},a_{j}]=0$ for some $1\leq i<j\leq d$ ...
0
votes
0
answers
112
views
Totally isotropic space for bilinear pairing over ring
A duplicate of this:
Consider the following well-known inequality: Let $b$
be a non-degenerate symmetric bilinear pairing over a (finite-dimensional) $\mathbb F$-vector space $V$ and $W$
a totally ...
0
votes
0
answers
312
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 ...
0
votes
0
answers
163
views
Generalization of polynomial coefficients
I'm dealing with a hard combinatorial problem where for every positive integer value of a variable $n$ I have to calculate a list of numbers, specifically $n^2$, that depend on $n$ and its list index ...
0
votes
0
answers
88
views
Separating orthogonal vectors in $\mathbb{C}^2$
Is it possible to partition $\mathbb{C}^2$ into two sets $S$ and $S'$ such that, given any two nonzero orthogonal vectors $\mathbf{v}$ and $\mathbf{w}$ of $\mathbb{C}^2$, one of them lies in $S$ and ...
0
votes
0
answers
19
views
Efficient Solution for tridiagonal solving with repeated coefficient lines
I working to speedup calls to LAPACK dgtsv for a specific case, where the the coefficients lines have 2 blocks of repeated coefficients and 3 distinct lines (first, "border" and last)
First ...
0
votes
0
answers
29
views
How to synthetize a controller $\dot{u} = F x + G u$ which stabilizes $\dot{x} = Ax + Bu$?
$\textbf{Introduction}$: I study linear control theory. Among strategies, we begin with vector field $Ax + Bu$, $A \in M_{n^2}(\mathbb{R})$, $B \in M_{n \times m}(\mathbb{R})$, and synthesize a ...
0
votes
0
answers
37
views
Telling if matrix is contractive from the spectrum of its Choi-Jamiołkowski isomorphism?
Suppose $T$ is a ${d^2}\times {d^2}$ completely positive matrix, and $M$ is ${d^2}\times {d^2}$ matrix obtained by taking Choi-Jamiołkowski isomorphism of $T$. Is it possible to tell if $T$ is ...
0
votes
0
answers
78
views
Let $A, B$ be matrices with elements in $\mathbb{Z}_n$, does $\ker A = \ker B$ imply that they are row equivalent?
Let $A, B$ be matrices with elements in $\mathbb{Z}_n$. If $A x = 0$ and $B x = 0$ have the same set of solutions, where the vectors also have elements in $\mathbb{Z}_n$, does this mean that there is ...
0
votes
0
answers
196
views
Generalized operator norm triangle inequality
Let $O_1, \cdots, O_n$ be Hermitian operators and $c_1, \cdots, c_n$ be complex numbers. If $\| \cdot \|$ denotes the operator norm, does the following inequality hold?
$$\| \sum_{i=1}^N c_i O_i \| \...
0
votes
0
answers
164
views
How to prove negativity of a $3\times3$ determinant whose elements involve trigamma, tetragamma, and pentagamma functions?
The classical Euler gamma function can be defined by the integral
\begin{equation*}
\Gamma(z)=\int_0^{\infty}t^{z-1}\operatorname{e}^{-t}\operatorname{d}t, \quad \Re(z)>0.
\end{equation*}
Its ...
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 ...
0
votes
0
answers
68
views
Optimal top-k column subset
Let $V$ be a set of vectors over $\mathbb{R}^l$, $l\ge 1$, $\pi_i(V)$ be the permutation of vectors in $V$ such that they are ordered by their $i$th component (descending) in order for $\pi_i(V)(\...
0
votes
0
answers
43
views
Intersection of subspace of cyclical rotations with orthant
In an $N$-dimensional real Euclidian space, let an orthant be specified by a vector
$\underline{x}_0 = \{x_1, x_2, \dots, x_N\}$ where the components $x_k$ are binary in the sense that $x_k = \pm 1$...
0
votes
0
answers
99
views
Efficient method to determine minimum eigenvalue of $2 \times 2$ block diagonal matrix
Suppose $H$ is a $2 \times 2$ block-diagonal symmetric matrix in $\mathbb{R}^{2^N \times 2^N} $. That is
$$ H = \begin{pmatrix} A_1 & 0 & \cdots & 0\\ 0 & A_2 & \cdots & 0 \\
...
0
votes
0
answers
92
views
Finding a point that minimizes sum of distances to a given set of lines
Given a set $L$ of size $n$ of lines in $\mathbb{R}^d$, find a point $x \in \mathbb{R}^d$ that minimizes: $$\sum\limits_{l\in L}\min\limits_{y\in l} {\lvert \lvert x-y \rvert\rvert}^2$$
I wrote a 1.5-...
0
votes
0
answers
87
views
Number of solution to homogeneous linear Diophantine equations
Let $T,M\in\mathbb{N}$ be fixed. Consider a linear Diophantine equation of the form
$a_1 x_1 + a_2 x_2 + … + a_n x_n = 0 $
with $a_i \in [-T,T] \subset \mathbb{Z}$. Is there an asymptotic formula to ...
0
votes
0
answers
83
views
When is the sum of matrices (circulant + [super upper triangular]) not diagonalizable?
By the circulant matrix $C \in M_n(\mathbb{R})$, we mean that
$$ C = \left[\begin{array}{c|c|c|c} e_n & e_1 & \cdots & e_{n-1} \end{array}\right] $$
where $e_1,\dots,e_n$ are the standard ...
0
votes
0
answers
74
views
Computing the eigenvalues of $A+E$ where $A$ is an upper triangular matrix whose diagonal entries are all zero and $E$ is a rank one matrix
Let us consider the backward-shift matrix $B=(b_{ij})\in M_n(\mathbb{R})$ whose entries are given by $b_{k,k+1}=1$ and the other entries are all 0. We also consider $X=(x_{ij})\in M_n(\mathbb{R})$ ...
0
votes
1
answer
310
views
Eigenvalues of $\operatorname{diag}({\bf v}) - {\bf v} {\bf v}^\top - \alpha({\bf v} - {\bf w})({\bf v} - {\bf w})^\top$
Given vectors ${\bf v}, {\bf w} \in [0,1]^n$ , where $n \in \mathbb{N} \setminus \{0\}$, and $\alpha > 0$, I would like to find the eigenvalues of the following matrix.
$$\operatorname{diag}({\bf v}...
0
votes
0
answers
146
views
Maximizing the norm of a sum of Hermitian matrices
Consider the following problem:
Problem: Given $n\times n$-Hermitian matrices $A_1,\dots,A_r$, find $e_1,\dots,e_r\in\{-1,1\}$ such that $\|e_1A_1+\dots+e_rA_r\|_\infty$ is maximized. Here the norm is ...
0
votes
0
answers
102
views
Construct a vector space whose elements are sets
I would like to construct a vector space whose elements are convex and closed subsets of $\mathbb{R}^n$.
A natural idea is as follows.
For any two sets $S_1, S_2 \subseteq \mathbb{R}^n$, define the ...
0
votes
0
answers
146
views
Linear dynamics in a function space
I posted the same question to Math Stackexchange earlier without much luck, so I am posting here.
I am dealing with a time-dependent model, which can be expressed as a function. $f$ is dependent on ...
0
votes
0
answers
133
views
On nilpotent singular $\mathbb F_2^{n\times n}$ matrices
Let $M$ be a $0/1$ matrix over $\mathbb F_2^{n\times n}$ with determinant $0$.
The set of such singular matrices form a semigroup.
The set of nilpotent matrices of size $n\times n$ form a semigroup.
...
0
votes
0
answers
177
views
Given optimality of L1 norm, prove that absolute value of sum of a vector with proper sign is less than 1?
Problem:
Given a domain $\mathcal{D}\subset\mathbb{R}^{l}$, we can find $l$
points $\boldsymbol{v}_{i}\in\mathcal{D}$, $i=1,\cdots,l$. Each
point is a column vector with dimension $l\times1$. They ...
0
votes
0
answers
205
views
Prove that sum of eigenvalues of the inverse of an nxn correlation matrix A is greater than or equal to n
I stuck on this question and here is my thoughts:
So we have a nxn correlation matrix A with eigenvalues: λ_1,λ_2,...,λ_n
1.According to the property of correlation matrix, (λ_1)+(λ_2) + ... + (λ_n) = ...
0
votes
0
answers
44
views
Sufficient conditions to order the solutions to a system of linear equations
A pretty elementary question, but does anyone know of sufficient conditions to order the solutions of a system of linear equations? For example, in the system, \begin{align*}\begin{bmatrix}a_{11}&...
0
votes
0
answers
172
views
A characterisation of full subgroups of $\mathrm{GL}_n(\mathbf{F}_p)$
Let $p\geq 5$ be a prime and $\mathbf{F}_p$ a finite field of characteristic $p$. A subgroup of ${\rm GL}_n(\mathbf{F}_p)$ is full if it contains ${\rm{SL}}_n(\mathbf{F}_p)$. When $n=2$, we have the ...
0
votes
0
answers
108
views
The eigenstructure of the symmetric tridiagonal matrix whose entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and $$a_{1,2}=\cdots=a_{n-1,n}=1$$
Suppose that $A=(a_{kl})_{k,l=1}^n$ is a symmetric tri-diagonal matix in $M_n(\mathbb{R})$ whose diagonal entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and
$$a_{1,2}=\cdots=a_{n-1,n}=1$$
Any approach to ...
0
votes
0
answers
125
views
Eigenvectors of the symmetric tridiagonal matrices whose entries above the diagonal are all the same
Let us consider the real symmetric tridiagonal matrix $T=(t_{kl})$ in $M_n(\mathbb{R})$ with
$$t_{1,2}=t_{2,3}=\cdots=t_{n-1,n}=1$$
How can we compute the eigenvectors of $T$?
0
votes
0
answers
126
views
On the absolute difference of the Laplacian eigenvalues of an unbalanced signed graph and its underlying graph
Let $\Sigma=(G,\sigma)$ be an unbalanced signed graph with the underlying connected graph $G=(V,E)$ and $\sigma:E\rightarrow \{-1,1\}$, the signing function. Let the Laplacian eigenvalues of $\Sigma$ ...
0
votes
0
answers
117
views
Covering zeroes of quadratic forms by linear forms
Consider a quadratic form
$$Q(x_1,\ldots,x_n)=\sum_{i,j}a_{ij}x_ix_j,$$
where $a_{i,j}\in \mathbb{R}$ and $x_i\in A$ for some $A\subset \mathbb{R}$ such what $|A|=k$.
Question. What is the smallest ...
0
votes
0
answers
145
views
Bound on solutions of $Ax \ge b$
Let $A \in \mathbb{Z}^{m \times n}, b \in \mathbb{Z}^{m \times 1}$.
One can show that if there is a solution of $Ax \ge b, x \in \mathbb{R}^n$ then there is one such that $\|x\|_{\infty} \le c (\|A\|_{...
0
votes
0
answers
112
views
What are the properties of square-matrix algebra with this equivalence class?
Consider the set of all square matrices with the following equivalence class:
$\mathbf{A}\sim\mathbf{A}\otimes\mathbf{I}_n$ (or, alternatively, as user @M.G. proposed, $\mathbf{A}\sim\mathbf{I}_n\...
0
votes
0
answers
273
views
Finding the eigenvectors of a submatrix
Let $A=(a_{kl})$ be a matrix in $M_n(\mathbb{R})$ when $n$ is even. Let $B=(b_{kl})$ be the symmetric $2n$ by $2n$ matrix whose entries are given by,
$b_{k,l}=a_{kl}$ if $1\leq k,l\leq n$.
$b_{n+k,l}=...
0
votes
0
answers
149
views
Diagonalizing a specific case of symmetric block matrix
Let's consider the following block matrix
$$ M = \begin{pmatrix}D&A^T\\A&-D\end{pmatrix},$$
where $A$ and $D$ are $n \times n$ matrices. The diagonal matrix $D$ is defined by $D_{kk} = k \...
0
votes
0
answers
233
views
How to analyse the range of eigenvalues of a symmetric and indefinite matrix?
Let $G$ be a symmetric and indefinite matrix defined as follows
$$ G := S - \begin{pmatrix} I_n & I_n \\ I_n & I_n \end{pmatrix},$$
where $S$ is a symmetric positive definite matrix of size $...
0
votes
0
answers
78
views
Topology of independence set of a vector space
This seems like something that would have a well-known treatment somewhere, but I'm not sure where to look. If we have a vector space $V$ (or maybe even a module), we can consider an abstract ...
0
votes
0
answers
104
views
Necessary and sufficient conditions for $\mbox{trace}(A^{-1/2}e^{-tB} (AB+BA) e^{-tB}A^{-1/2}) \ge 0$ for all $t$
Let $A$ and $B$ be positive-definite matrices of the same size. For any $t \ge 0$, define
$$
u(t) := \mbox{trace}(A^{-1/2}e^{-tB} (AB+BA) e^{-tB}A^{-1/2}).
$$
Question. What are necessary and ...
0
votes
0
answers
174
views
Lipschitz map on positive definite cone of $n$-by-$n$ matrices
A function matrix $f : X \to \mathbb R$ is a convex Lipschitz continuous matrix function with Lipschitz constant $\mathrm L$ with respect to a fixed given norm $\|\cdot\|$, i.e., $|f(A)-f(B)| \leq \...
0
votes
0
answers
171
views
Multiplying by Loewner-ordered matrices
Suppose $A$ and $B$ are symmetric positive (semi-)definite, and $A<B$ in Loewner order, meaning $B-A$ is positive (semi-)definite. Is it true that, for a symmetric positive-definite $C$, we have $...
0
votes
0
answers
108
views
Solving a nonlinear equation maybe with Lambert W function
Can you please help me solve the following nonlinear equation?
\begin{equation}
\boldsymbol{z} \odot\left(\boldsymbol{\Gamma}^{\top} \boldsymbol{y}\right)=(\beta)^{\frac{1}{m-1}}\left(\frac{m-1}{...
0
votes
0
answers
145
views
Given a binary parity check matrix, find a parity check matrix for the same code such that no row has weight greater than $k$
A parity check matrix for a binary linear code is a matrix $H$ (with linearly independent rows) such that the (right) kernel of $H$ is the codespace. Clearly we can replace any row $r_i$ by $r_i + \...
0
votes
0
answers
156
views
Optimal solution of complex optimization problem
Let $Q(x)=a(x)e^{jb(x)}$ be a complex function of $x$. We want to approximate this function with $R(x)=\alpha e^{jx\beta}$ such that
\begin{align}
\text{arg}\min_{\alpha,\beta} \int_{-\frac{A}{2}}^{\...