Questions about the properties of vector spaces and linear transformations, including linear systems in general.

learn more… | top users | synonyms

2
votes
0answers
69 views

Open problems in compressed sensing

What are the main open problems in compressed sensing? I am interested in theoretical as well as in numerical point of view.
1
vote
1answer
231 views

Diagonalization of 4th order tensors

I have been wondering about the following problem... Let $n$ be a positive integer and denote by $M_n^s$ the space of symmetric $n\times n$ real matrices. Now, we look at the space $\mathcal ...
3
votes
1answer
79 views

Eigenvectors of a symmetric positive definite Toeplitz matrix

I wish to efficiently compute the eigenvectors of an n x n symmetric positive definite Toeplitz matrix K. A full eigendecomposition would be even better. Although I assumed this would be a well ...
0
votes
0answers
122 views

On matrix rank inequality

Let $A$ be a $\{0,1\}$ square matrix. Let $J$ be all $1$ matrix. Let $\bar{A}=J-A$. Is it possible for $rk_+(A)\geq c\cdot rk_+(\bar{A})^d-1$ and $rk_+(\bar{A})\geq c\cdot rk_+({A})^d-1$ for some ...
-4
votes
0answers
37 views

transition matrix [on hold]

Gene mutation. Suppose a gene in a chromosome is of type $A$ or type $B$. Assume that the probability that a gene of type $A$ will mutate of type $B$ in one generation is $10-4$ and that a gene of ...
6
votes
1answer
166 views

Diagonalization of the matrix $(1/(i+j+\rm{const}))_{i,j}$

Consider the following infinite matrix: $A_{i,j}=\frac1{i+j+\gamma}$, $0\leq i,j<\infty$, $\gamma>0$ is a constant. Is it known how to diagonalize $A$, or, say, calculate $(I+tA)^{-1}$ for ...
6
votes
1answer
152 views

Exotic “non-linear” (but “almost linear”) automorphisms of symplectic vector space

Let $V$ be a vector space over a field $k$ equipped with a symplectic form $\omega$. Let $f:V \rightarrow V$ be a bijective set map such that the following hold. For all $v \in V$ and $c \in k$, we ...
8
votes
3answers
516 views
+100

Does a left basis imply a right basis, without AC?

If $_DV_D$ is a $D$-$D$-bimodule, and we have a $D$-basis for $V_D$, do we still need AC to get a $D$-basis for $_DV$? (The original question appears below. But this shorter question gets at the ...
1
vote
1answer
90 views

Speed up Linear programming

I have a linear programming problem like this: minimize $c^t X$ under the constraint that $AX \ge b$. I will need to solve this linear programming problem online many times. I need it to be as fast ...
0
votes
0answers
30 views

Canonical forms of symmetric/skewsymmetric quaternionic matrix

$A$ belongs to $n$-dimensional quaternion symmetric matrix, in the sense that $A=A^T$, where $T$ means transpose. Under transformation $U$, $A\rightarrow U\cdot A\cdot U^T$, where $U$ is $n$-dim ...
3
votes
0answers
362 views

The twisted kiss of the curvaceous cubic and the staid tetrahedron (references)

(Migrated from MSE) While investigating some operators, I came across some relations between the twisted cubic curve and the tetrahedron that link together some notions in differential geometry, ...
10
votes
2answers
884 views

How to transform matrix to this form by unitary transformation?

Without loss of gernerality, we can only consider $n$-dimensional diagonal matrix $M$ whose elements are all nonnegative, i.e. $$M=\operatorname{diag}(m_1,m_2,\cdots,m_n)\ (m_i \geq 0).$$ Then is ...
4
votes
2answers
437 views

Central idempotents from characters in Frobenius algebras (generalizing Lusztig arXiv:math/0208154v2 §19)

$\newcommand{\refone}{\textbf{(1)}} \newcommand{\Hom}{\operatorname{Hom}} \newcommand{\tr}{\operatorname{Tr}} \newcommand{\kk}{\mathbf{k}}$ Let $\kk$ be a field. Let $A$ be a $\kk$-algebra which is ...
1
vote
1answer
107 views

finding permutation matrix I which minimizes TRACE( I* C*( I^T)* D) matrix

I have a problem that is really important for my thesis and i am not studding math so i will be very glad if you help me in this case... thanks for your help in advance I want to find permutation ...
1
vote
0answers
25 views

Inverse of the covariance of the estimate of a covariance

I have a covariance matrix, $V_{ij}$, which (for reasons that aren't important) I'm going to call the visibilities. I have an estimator for the visibilities $\hat V_{ij}$, and I've derived that the ...
1
vote
1answer
60 views

Bringing a (Least Squares Problem) Matrix into Block Upper-triangular Shape via Matrix-reordering

I have the problem of solving very large and very sparse least squares problems and, a bit dissatisfied with the run-times of the full-fledged QR-algorithm, I would like to bring the instances into ...
-1
votes
0answers
47 views

The invertibility of matrix (I - XX')? [closed]

I is an identity matrix of size n*n. X is a matrix of size n*k(Assuming k<= n). As we know, (I+XX') is invertible. Because (I+XX') = (I X)*(I X)', where (I X) is invertible. So I'm wondering ...
0
votes
1answer
132 views

Bounded domain matrix factorization

Assume we're trying to find $A\in [-1,1]^{n\times d}, B\in [-1,1]^{m\times d}$, from an observed matrix $C\in [-d,d]^{n\times m}$, where $C=AB^T$. The goal is to return $\widehat A, \widehat B$ such ...
4
votes
4answers
839 views

determinants and polynomials in matrices

Muirhead (1982, "Aspects of Multivariate Statistical Theory") references on page 59 a result (from MacDuffee, 1943, chap 3, "Vectors and Matrices") a book I cannot find): " The only polynomials in ...
0
votes
0answers
115 views

$Ax=b$ in a function space (again)

Let $X$ be compact Hausdorff topological space, $C(X)$ denote the algebra of complex-valued continuous functions on $X$, $b\in \mathbb{C}^m$, $\mathbf{A}\in C(X)^{m\times n}$, Let ${\mathbb{C}}^n$ ...
0
votes
2answers
62 views

Tensor product-definition-balanced versus bilinear maps

When defining tensor products $M\otimes_R N$ over a commutative ring $R$ one can use a universal property with respect to bilinear maps $M\times N\rightarrow P$, for any $R$-module $P$. On the other ...
0
votes
3answers
131 views

Infinite dimensional vector spaces

This question might seem elementary but I cannot answer it. Let M be an infinite dimensional vector space and $f_1, f_2, \cdots , f_r \in M^*$ be a set of linear independent vectors with $r \geq 2$. ...
3
votes
2answers
242 views

(linear algebra) - Can a symmetric equilibrium achive higher social-welfare than some equilibrium with the same support?

EDIT: rewritting the question to linear algebra to make it more accessible. Denote by $\Delta([n])$ the set of all probability distributions over $\{1,2,\ldots,n\}$, that is: ...
1
vote
2answers
138 views

Characteristic polynomial of Kronecker/tensor product

This was asked before on stackexchange but no answer was given. The question is the following: Let $A$ and $B$ be matrices in $GL(n)$ and $GL(m)$ respectively. Their tensor product $A\otimes B$ is ...
7
votes
1answer
138 views

Is there a ring which is not Hermite but is coherent?

Call a commutative unital ring $R$ Hermite if for all $m, n\in \mathbb{N}$ with $m<n$, and all $f\in R^{m\times n}$ such that transpose($f$) is left invertible (with a matrix with entries from ...
1
vote
0answers
92 views

How to prove the following claim about Pseudoinverse

For real symmetric matrices $K$ and $\hat{K}$, if $u^{T}{K}u\le u^{T}\hat{K}u\le C u^{T}{K}u$ for all $u$ in the row space of $K$, then $u^{T}{K^{+}}u\ge u^{T}\hat{K}^{+}u\ge u^{T}{K^{+}}u/C$ for all ...
4
votes
1answer
123 views

Compute adjugate matrix over commutative ring

Let $A$ be a $n\times n$ matrix over a commutative ring. I'm looking for a good method to compute its adjugate matrix. My current approach is to use the Cayley-Hamilton theorem: $$\text{adj}(A) = ...
5
votes
1answer
534 views

Proving that the kernel of this matrix is of dimension 2

(Edit : see at the bottom of the question for an additional surprising possible hint.) Using a computational software program, I found that the kernel of the following matrix is of dimension 2 when ...
1
vote
1answer
81 views

Linear map of Zonotopes [closed]

Consider a linear system with a map $A: \mathbb{R}^n \rightarrow \mathbb{R}^m$ such that $y = A x$ with $n \geq m$ The input space $x$ is constrained by a zonotope set $\mathcal{X} \subseteq ...
0
votes
1answer
81 views

How to convert non-PSD matrix to PSD matrix?

I have a mixed-integer optimization problem with the following constraint matrix $Q_1$: \begin{array}{cccccc} 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & -1 & 0 ...
0
votes
1answer
146 views

$Ax=b$ in a function space

Let $X$ be compact Hausdorff topological space, $C(X)$ denote the algebra of complex-valued continuous functions on $X$, $b\in \mathbb{C}^m$, $\mathbf{A}\in C(X)^{m\times n}$, for all $x\in X$, ...
0
votes
0answers
180 views

Eigenvalue of a linear map over finite field

Let $ F_q $ be a finite field with $ q $ elements. Let $ g $ be a multiplicative generator of $ F_{q^2}^* $. It implies that $ <g^{q+1}> = F_q^* $. Let $ l $ be a prime greater than $ q^2-1 ...
2
votes
2answers
120 views

Number of *distinct* dot products of an integer vector by elements of a hyper-rectangle

Imagine a vector $\boldsymbol{v}$ composed of integers, and the set $S$ of all integer vectors within a hyper-rectange, with one corner at the origin and other at $\boldsymbol{m}$. In other words: $S ...
4
votes
2answers
111 views

Graphs whose degree vectors coincide for all powers of their adjacency matrices

Let symmetric $A,B \in \{0, 1\}^{n \times n}$ denote the adjacency matrices of two simple graphs. Further let $\mathbf{1}$ denote the all-one-vector. Now assume that $A^k \mathbf{1} = B^k \mathbf{1}$ ...
0
votes
0answers
26 views

Estimate bounds on Minkowski distance from point to a segment in Lp space

Assumptions Let $L_p(x,y)=(\sum_i|x_i - y_i|^p)^{1/p}$ (Minkowski metric), $a,b$ be arbitrary $n$-dimensional points, $c$ be a point that satisfies $L_p(a,b) = L_p(a,c) + L_p(c,b)$, i.e., a point ...
1
vote
1answer
60 views

When a homogeneous map between vector spaces is also additive?

Suppose to have two real vector spaces $V$ and $W$ and an injective map $T:V\rightarrow W$ such that $T(\alpha v)=\alpha T(v)$ for all $v\in V$ and $\alpha \in\mathbb{R}$. Do there exist some ...
1
vote
1answer
104 views

Cycles of Permutation Related to Rectangular Matrix Transposition

let the entries of a rectangular matrix $A\in\mathbb{C}^{m\times n}; m,n\in\mathbb{N}$ be stored in row-order in a linear vector $v$, i.e. $A_{i,j}=v_{i*m+j}$ Question: How can the first element ...
3
votes
0answers
60 views

Reasoning about dependent and independent quantities by “degrees of freedom”

In his classic textbook Foundations of the Theory of Probability Kolmogorov defines Independence a little bit differenent then it is usually done today. He denotes a probability space by $(E, \mathcal ...
3
votes
1answer
1k views

Matrix approximation

Let A be an $m\times n$ matrix and $k$ be an integer. Assume that $A$ is non-negative. We want to find a scalar $\epsilon$ and an $n\times n$ matrix $B$ such that $A\leq A(\epsilon I + B)$ (where ...
2
votes
1answer
95 views

Quaternion Wishart matrices of half-integer dimension?

For a physics application (quantum delay times of a chaotic scatterer) I need to generate $m$ positive random variables $\lambda_1,\lambda_2,\ldots\lambda_m$ with probability distribution ...
2
votes
0answers
47 views

Sum of the entries of the inverse covariance matrix

Let $T \in\left(0,1\right)$, $n\in\mathbb{N}$ and $e_n = [1,\ldots,1]\in\mathbb{R}^n$. Consider the covariance matrix $\mathfrak{A}_n = ...
-2
votes
0answers
75 views

Minimum distance in unit cube

Given the unit cube $I^n=[0,1]^n$, let $x_1,\cdots,x_n\neq (0,0,\cdots,0)$ be $n$ linearly independent vertices (corners) of $I^n$, and $p(x_1, \cdots, x_n)$ be the projection of $(0,0,\cdots,0)$ onto ...
4
votes
1answer
144 views

Rank 1 Approximation of Elementwise Inverse Matrix

I'm wondering whether there is a good way to solve the following optimisation problem. Given a strictly positive quadratic matrix $A$, find two diagonal matrices $D_1$ and $D_2$ so that $$ \| D_1 A ...
0
votes
1answer
476 views

eigen-decomposition solution? is it unique?

Assume an N*N covariance matrix (Q) which is a positive definite matrix. The decoder X is assumed to be N*s, where s<=N. X is calculated to be s eigenvectors corresponding to s minimum eigenvalues. ...
-1
votes
1answer
178 views

Collecting terms of a linear expression with nested sums and combinatorics in coefficients

I need to collect the $\Pr(\cdot)$ terms of the following expression: $\sum_{m=3}^{n}\frac{g_{m}\left( \cdot \right) }{\left( \sqrt{\theta \left( 1-\theta \right) }\right) ^{m}}\left[ ...
0
votes
0answers
54 views

Computer software for manipulating loop groups or matrices with polynomial entries

I need to deal with loop groups $LG$ over the complex numbers $\mathbb{C}$, as well as related spaces like the affine Grassmannian and affine flag variety a lot. In type A, the loop group consists ...
1
vote
4answers
2k views

Eigenvalues of Symmetric Tridiagonal Matrices

Suppose I have the symmetric tridiagonal matrix: $ \begin{pmatrix} a & b_{1} & 0 & ... & 0 \\\ b_{1} & a & b_{2} & & ... \\\ 0 & b_{2} & a & ... & 0 ...
9
votes
1answer
335 views

Sum of commuting semisimple operators

Let $V$ be a finite dimensional vector space over a field $K$. An operator $T:V\to V$ is called semi-simple if every $T$-invariant subspace of $V$ has a $T$-invariant complement(for algebraically ...
5
votes
0answers
112 views

Perron-Frobenius theory for reducible matrices

Can someone suggest some sources/references dealing with the Perron-Frobenius theory for nonnegative matrices that are reducible? Specifically, if $A\ge 0$ is a $d\times d$ matrix with no assumptions ...
13
votes
2answers
503 views

Codimension of the range of certain linear operators

Assume that $P(x,y), Q(x,y) \in \mathbb{R}[x,y]$ are two polynomials. We define a linear map $D$ on $\mathbb{R}[x,y]$ with $D(U)=PU_{x}+QU_{y}$. In fact $D$ is the derivational operator correspond ...