**-1**

votes

**0**answers

56 views

### Are there any special properties of graph eigenvalues of perfect matchings?

Say if the graph is just a perfect matching of its vertices OR if it is an union of a few perfect matchings OR its an union of a few perfect matchings and a part of another?
Anything if one further ...

**-1**

votes

**0**answers

77 views

### Degrees of multilinear polynomials satisfying some constraints

Let $t<\sqrt{n}$.
$\Bbb Z^t[x_1,\dots,x_n]=\{f\in\Bbb Z[x_1,\dots,x_n]: deg(f)\leq t$ and $f$ is multilinear$\}$.
Fix an ordering of $S=\{0,1\}^n.$
If $f\in\Bbb Z[x_1,\dots,x_n]$, let $f(S)$ be ...

**2**

votes

**1**answer

77 views

### Resolvent of a triangular matrix

Suppose $A$ is a triangular matrix. What is the most efficient known algorithm to compute the polynomial (in $x$) matrix $(xI-A)^{-1}$?
Of course, $(xI-A)^{-1}= N(x)/p_A(x)$, where $p_A$ is the ...

**0**

votes

**0**answers

14 views

### the ratio between product of two trace functions maximization

Consider the following Optimization
[\begin{array}{l}
\mathop {\max }\limits_{\bf{X}} \,\frac{{trace\left( {{\bf{XA}}} \right)trace\left( {{\bf{XB}}} \right)}}{{trace\left( {{\bf{XC}}} ...

**2**

votes

**0**answers

54 views

### Worst-Case Solution to (Stochastic) Matrix Inequality

EDIT: Some specific conjectures added.
This problem comes with an associated stochastic process, but I phrase everything as linear algebra in case somebody from a non-probability community has seen ...

**-1**

votes

**1**answer

104 views

### Powers of orthogonal matrices is closed

This might be a basic question, nonetheless I cannot give a proof.
Given an orthogonal matrix $A$ with eigendecomposition $A = Q \Lambda Q^{-1}$ with only non-real eigenvalues. Given also a diagonal ...

**3**

votes

**1**answer

61 views

### Characterizing space that preserves positive-definiteness property

Given a symmetric positive-definite matrix $\Sigma$, consider the space $\mathcal{D}$ of diagonal matrices such that $\forall D\in\mathcal{D}$, the matrix $\Sigma-D\Sigma^{-1}D$ is positive definite. ...

**2**

votes

**1**answer

82 views

### Unitary factor in polar decompositions

Let $A, B$ be $n$-square (Hermitian) positive definite matrices. Let $AB=U|AB|$ be the polar decomposition of $AB$. So $U$ is unitary (called the unitary factor of $AB$). What is the optimal constant ...

**3**

votes

**1**answer

174 views

### Example of proof using the generic matrix

There is a really nice proof of the Cayley-Hamilton Theorem using the generic matrix. I expose it briefly.
One defines the generic matrix $G:=(X_{ij})_{ij} ...

**13**

votes

**3**answers

1k views

### How are these two ways of thinking about the cross product related?

I was always bothered by the definition of the cross product given in e.g. a calculus course because it's never made clear how one would go about defining the cross product in a coordinate-free ...

**-2**

votes

**0**answers

27 views

### maximization of products of two trace function [on hold]

consider the following optimization problem:
\begin{array}{l}
\mathop {\max }\limits_{\bf{X}} \,\,\,\operatorname{trace}\left( {{\bf{XA}}} \right)\operatorname{trace}\left( {{\bf{XB}}} \right)\\
...

**0**

votes

**0**answers

16 views

### 4th order statistics of Circularly Symmetric Complex Normal random vector? [on hold]

Assume that ${\bf z} \in C^{n×1}$ is a CSCG random vector denoted with $C (μ,Σ)$ where $μ$ and $Σ$ are mean and contrivance matrix, respectively, and defined as
$μ=E({\bf z})$, $Σ=E({\bf z}{\bf ...

**0**

votes

**0**answers

60 views

### Is there an improvement for the Schur-Horn inequalities for positive semi-definite matrices?

By the Schur-Horn inequality I am thinking of the statement that for any Hermitian matrix $H$ its diagonal n-tuple $(H_{11},H_{22},..,H_{nn})$ for any choice of basis lies in the convex hull of the ...

**8**

votes

**1**answer

141 views

### Powers of traces, integrals over spheres and class functions

I asked this on math.StackExchange a while back but got no answers. I hope I'll be forgiven for the double post.
Let $V$ be a complex vector space of dimension $\operatorname{dim}_{\mathbb C} V = n$, ...

**-4**

votes

**0**answers

28 views

### Find solution of signle element $y_i$ in vector $y$ subject to $Ay=c$ [on hold]

I have a interesting question about linear algebra problem. Assume that I have a matrix $A^{m \times n}$ and vector $c^{n \times 1}$ are known and I want to find the solution of vector y subject to ...

**0**

votes

**1**answer

57 views

### Adjusting matrix in generalized eigenvalue problem for the design of eigenfunctions

Take two matrices $A,B \in \mathbb{R}^{n\times n}$. I am considering the generalized eigenvalue problem ($\gamma \in \mathbb{R}, \phi \in \mathbb{R}^n$)
$$A\phi = \gamma B\phi.$$
Is there a ...

**0**

votes

**1**answer

304 views

### Applications of the natural bilinear forms on the direct sum between a vector space and its dual

As is known, the vector space $V\oplus V^\ast$ admits the natural symmetric and skew-symmetric bilinear forms
$$\langle X+\xi,Y+\eta\rangle|_\pm:=\frac 1 2 (\xi(Y) \pm \eta(X)).$$
I am interested in ...

**-2**

votes

**0**answers

53 views

### An analytic characterization of eigenvalues of a Hermitian matrix [on hold]

[..the following is trying to understand a certain argument of Terence Tao in a lecture notes of his..]
If $A$ is a Hermitian matrix with eigenvalues, eigenvectors $\{ \lambda_i , e_i \}_{i=1}^n$. ...

**2**

votes

**1**answer

77 views

### Do the sequences with divergent associated $\zeta$-function form a vector space?

Let $V$ be the set of sequences $a \in\mathbb{R}^\mathbb{N}$ such that $\lim_{n\to\infty} a_n = 0$. The set $V$ can be seen as a real vector space, with pointwise addition and scalar multiplication.
...

**0**

votes

**0**answers

49 views

### Matrix equation

Let $A$ be $k\times n$ matrix i.e., $A=(a_{1},\ldots, a_{n})$ where $a_{j} \in \mathbb{R}^{k}$, $rank(A)=k$ and $1\leq k \leq n$. Let $q=(q_{1},\ldots, q_{n})\in\mathbb{R}^{n}$ be such that ...

**0**

votes

**0**answers

17 views

### Solution to a system of linear equations containing some inequalities [closed]

I have a system of equations as follows:
$a_{11}x_1 + a_{12}x_2 + a_{13}x_3 = b_1$
$a_{21}x_1 + a_{22}x_2 + a_{23}x_3 = b_1$
$a_{31}x_1 + a_{32}x_2 + a_{33}x_3 < b_1$
$a_{41}x_1 ...

**-4**

votes

**0**answers

28 views

### Find the vector component of vector u orthogonal to vector a [closed]

I have vector u = (-2, 3, 1) and vector a = (-2, 2, 2). How do I find the vector component of u orthogonal to a?
I've done the cross product and I get (-4,-2,-2), but I am assuming that this is also ...

**-4**

votes

**0**answers

62 views

### About diagonal entries of the graph Laplacian [on hold]

[..in the following you can assume its a regular graph if necessary..]
Is anything special known about them?
Are they characterized in any other way?
Is the largest diagonal entry in any power of ...

**4**

votes

**0**answers

119 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 ...

**1**

vote

**0**answers

82 views

### Can anyone help me deduce a matrix inequality?

The following lemma is taken from references firstly.
Lemma 1 [1-2] Given matrices $Q=Q^{T} , F, M$ and $N$ of appropriate dimensions, then $$Q+MFN+N^{T}F^{T}M^{T}<0$$
for all $F$ satisfying ...

**-3**

votes

**3**answers

278 views

### Determinant of matrix from set {-1, 1} [on hold]

Let $A \in \mathbb{R}^{11 \times 11}$ and it's elements are form set $\{ -1,1 \}$. $\mathbb{P}(-1) = \mathbb{P}(1) = 0.5$. What is a probability to get such a matrix, that $\det A > 4000$?
I have ...

**1**

vote

**1**answer

213 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 ...

**0**

votes

**0**answers

104 views

### Alternate proof of Schur orthogonality relations [migrated]

I am trying to find an alternate proof for Schur orthogonality relations along the following lines.
Let $G$ be a finite group, with irreducible representations $V_1$, $V_2$, $\cdots$, $V_d$.
Let $V$ ...

**38**

votes

**1**answer

733 views

### Determinant of a determinant

Consider an $mn \times mn$ matrix over a commutative ring $A$, divided into $n \times n$ blocks that commute pairwise. One can pretend that each of the $m^2$ blocks is a number and apply the $m ...

**6**

votes

**2**answers

409 views

### About Sylvester's determinant

If $A$ is any $n \times m$ matrix and $B$ is any $m \times n$ matrix then one familiar form of the Sylvester's identity is $\det(I + AB) = \det(I + BA)$.
Now somehow curiously this above identity ...

**6**

votes

**0**answers

69 views

### In what sense is the Bayesian posterior mean a “convex combination”?

I asked this on math.stackexchange with no response, I'm hoping someone here might have something.
Suppose I want to estimate $x \in \mathbb{R}^n$ from two signals with zero mean, normally ...

**9**

votes

**2**answers

833 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 ...

**1**

vote

**0**answers

91 views

### Infinite matrices with a finite number of non-zero values on each row

The little bit of literature on infinite matrices I've been able to find studies a general setting in which the theory is hindered by constantly having to worry about whether or not various infinite ...

**1**

vote

**2**answers

276 views

### How to prove that a kernel is positive definite?

For example, how to prove
$\forall(x,y)\in R^N\times R^N,K(x,y) = \displaystyle\frac{1}{1+\frac{||x - y||^2}{{\sigma}^2}}\\$
where $\sigma > 0$ is a parameter, is positive definite? I have tried to ...

**11**

votes

**2**answers

463 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 ...

**2**

votes

**2**answers

156 views

### When does a Vandermonde-like matrix have full rank

I have a matrix which is similar to Vandermonde matrix except that the entries are monomials of degree $d$ polynomial in 2 variables. Each row has the following form:
$X_{i}= [1, x_{i}, y_{i}, ...

**43**

votes

**3**answers

8k views

### Slick proof?: A vector space has the same dimension as its dual if and only if it is finite dimensional

A very important theorem in linear algebra that is rarely taught is:
A vector space has the same dimension as its dual if and only if it is finite dimensional.
I have seen a total of one proof ...

**0**

votes

**1**answer

126 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 ...

**1**

vote

**0**answers

33 views

### Distributing partially known data between n parties

Assume that $n = 2r+1$. There are $n$ elements $a_1,a_2,\ldots,a_n$ from a finite field $\mathcal{F}$, and $n$ parties. Each party knows the values of at least $r+1$ elements out of those $n$ ...

**3**

votes

**0**answers

29 views

### Counting cosets of matrices of determinant > 1 under the action of a congruence subgroup

I tried asking this on math exchange, but no luck, so thought I'd try here.
Let $M_2(m,\mathbb{Z}) $ be the $2\times 2$ matrices with integer entries and determinant $m$. Let $\Gamma^0(N)$ be the ...

**3**

votes

**0**answers

109 views

### Commutative decomposition for full-rank $A$ and low-rank $B$ matrices that do not commute

1. Motivation
Consider symmetric matrices $A,B\in\mathbb{R}^{n\times n}$, and let $A$ be full-rank and $B$ be low-rank. The simultaneous block-diagonalization, defined as the following
...

**0**

votes

**0**answers

18 views

### Composition of Lossless Systems from Delay and Mixing regarding junction admittance

Given $m_1, \dots m_N \in \mathbb{N}$ and matrix $\mathbf{A} \in \mathbb{C}^{N\times N}$.
Let us define a diagonal matrix $\mathbf{D}(z) = diag(z^{-m_1}, \dots, z^{-m_N})$ with $z\in\mathbb{C}$. ...

**11**

votes

**0**answers

224 views

### Ratio of entries of A and log A where A is a triangular matrix

Consider triangular matrices $A = \left( {a(n,k)} \right)$ of arbitrary order with $a(n,k) = 0$ if $n + k$ is odd and $a(n,n - 2k) = \frac{{n!}}{{k!(n - 2k)!}}\frac{{(m + n - k - 1)!}}{{(m + n - ...

**13**

votes

**6**answers

688 views

### Does the linear automorphism group determine the vector space?

I was recently thinking about what it means to put structure on a set. It seems to me that, in my area (representation theory), the two main ways of imposing structure on a set $X$ are:
...

**4**

votes

**1**answer

147 views

### Dirichlet Characters as Eigenvectors

This was asked in Math Stackexchange here but generated no comments or answers. I have slightly edited the original question with the comment in the fourth paragraph and the explicit matrix example at ...

**7**

votes

**1**answer

156 views

### Problems where Conjugate gradient works much better than GMRES

I am interested in cases where Conjugate gradient works much better than GMRES method.
In general, CG is preferable choice in many cases of SPD because it requires less storage and theoretical bound ...

**2**

votes

**0**answers

76 views

### Copositivity under tensor products

Is there any symmetric real matrix $A$ such that $A^{\otimes n}$ is copositive for all positive integers $n$, but such that A is neither positive semidefinite nor has just non-negative entries?
...

**1**

vote

**1**answer

71 views

### Nonlinear system of equations whereas most of the equations are linear. How to minimise operation?

Let us say we have a n * n system of equations like KU=F where K is a n*n matrix and U and F are n*1 vectors. K and F are defined and the final goal is to find U values.
K is a sparse banded matrix ...

**29**

votes

**21**answers

7k views

### Why linear algebra is fun!(or ?)

Edit: the original poster is Menny, but the question is CW; the first-person pronoun refers to Menny, not to the most recent editor.
I'm doing an introductory talk on linear algebra with the ...

**1**

vote

**0**answers

85 views

### Pre- and post-multiplication by diagonal matrices [closed]

Let $\mathbf{1}$ denote an $n\times 1$ vector with all entries equal to 1. Given an $n\times n$ matrix A with strictly positive entries, and non-negative diagonal matrices $D_1$ and $D_2,$ evaluate ...