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

learn more… | top users | synonyms

1
vote
0answers
34 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
0answers
35 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 ...
0
votes
0answers
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}$. ...
7
votes
2answers
431 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 ...
4
votes
1answer
151 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 ...
2
votes
0answers
81 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? ...
3
votes
0answers
111 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 ...
1
vote
0answers
86 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 ...
13
votes
6answers
706 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: ...
1
vote
1answer
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 ...
11
votes
0answers
227 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 - ...
4
votes
0answers
110 views

minimal polynomial for a graph

I wonder if there is any result relating the degree $d$ of the minimal polynomial of a directed finite graph to any of its topological features - such as its diameter, or any other similar 'natural' ...
2
votes
1answer
141 views

Let $R$ be a $M\times N$ matrix with rational entries, Is $|(R\mathbb{Z}^N)/\mathbb{Z}^M|=|(R^T\mathbb{Z}^M)/\mathbb{Z}^N|$?

Let $R$ be a $M\times N$ matrix with rational entries, $R\mathbb{Z}^N$ be the image of $\mathbb{Z}^N$ under R. Consider a equivalent relation on $R\mathbb{Z}^N$ defined by $a\sim b$ if $a-b\in ...
5
votes
2answers
266 views

Partial inverse of a matrix - or does it have its own name?

In my calculations I need to use something which is "between" a matrix and its inverse. That is, I invert only some dimensions. I am interested if it has an established name. That is, a matrix (here ...
23
votes
2answers
1k views

When exactly and why matrix multiplication became a part of undergraduate curriculum?

The story about Heisenberg inventing matrices and matrix multiplication in 1925 is very well known and well documented. Few weeks later Born and Jordan picked this and recognized the matrix ...
1
vote
0answers
52 views

Decomposition of non-singular matrix [closed]

Is there any way to show that a non-singular matrix A can be partitioned as follows: \begin{eqnarray*} A&=&\left[ \begin{array}{cc} \underset{\left( k\times k_{1}\right) ...
38
votes
1answer
762 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 ...
0
votes
0answers
139 views

Problem regarding orthogonal vectors

Suppose $C_{1},C_{2},...,C_{n}$ are $0-1$ vectors of length $m$. Given $C_{i} \in \{0,1\}^{m}$ with $C_{i}=x_{i1}x_{i2}...x_{im}$ we say $C_{i}'=x_{i1}'x_{i2}'...x_{im}'$ is a subvector of $C_{i}'$ if ...
6
votes
0answers
167 views

Product $PVPVP$ is elementwise nonnegative?

Let $P\in \mathbb{R}^{n\times n}$ be the inverse of a positive definite M-matrix and $V\in \mathbb{R}^{n\times n}$ be any diagonal matrix. Prove (or disprove) that $PVPVP$ is elementwise nonnegative. ...
5
votes
3answers
110 views

Minimize distance between centroids of subsets of points

In a n-dimensional space, I want to divide a set of m points into v (non-empty) subsets. I want to minimize the sum of the pairwise Euclidean distances between the centroids of the resulting subsets. ...
5
votes
1answer
192 views

Anti-bidiagonal matrix with main anti-diagonal {1,2,3,…} and first sub-anti-diagonal {-1,-2,-3,…} has eigenvalues lambda={1,-2,3,-4,…}

Consider the anti-bidiagonal matrix $B_6\in\mathbb{R}^{6\times 6}$, defined along its anti-diagonals as follows $$ B_6=\begin{bmatrix} & & & & & 6\\ & & & ...
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 ...
4
votes
2answers
181 views

Do singular values dominate eigenvalues?

Suppose $A$ is an $n \times n$ complex matrix with singular values $s_1 \ge s_2 \ge \cdots \ge s_n$ and eigenvalues $(\lambda_i)_{i=1}^{n}$ arranged so that $|\lambda_1| \ge |\lambda_2| \ge \cdots ...
1
vote
2answers
159 views

Question on Posets and open sets [closed]

i'm sorry if my question is really trivial but this one is really bugging me out.. So let's have a partially ordered set $I$ with the topology in which the open sets are the increasing ones: $i\in U$ ...
7
votes
2answers
187 views

Are sums of 0-1 Pareto efficient vectors Pareto efficient?

Does there exist $m,n\ge1$, an $m \times n$ matrix $A$, and a vector $x \in \mathbb{R}^n$ such that: The entries of $A$ are $\in \{0, 1\}$. For all pairs of columns $u, v$ of $A$ the entries of $u - ...
0
votes
0answers
38 views

Questions about some special tensor transformation

Suppose tensor $U_{i\alpha\beta}$ with dimension $M*N*N$ satisfy following condition: $$U_{i\beta\alpha}=W^1_{\alpha\alpha'}W^2_{\beta\beta'}U_{i\alpha'\beta'}$$ where $W^1$ and $W^2$ are $N*N$ ...
1
vote
1answer
153 views

Is the notation ${}^t g$ for the transpose of a linear transformation intended to be suggestive?

The notation ${}^t g$ for the transpose of a linear transformation is, in my view, quite unusual: otherwise (at least in many areas of math), one almost never sees subscripts or superscripts appearing ...
2
votes
1answer
106 views

Which nonnegative matrices have exact nonnegative matrix factors of smaller dimensionality?

The nonnegative matrix $V = \left( \begin{array}{cc} 1 & 1 \\ 1 & 1 \end{array} \right)$ has nonnegative matrix factors $W = \left( \begin{array}{c} 1 \\ 1 \end{array} \right)$ and $H = ...
2
votes
0answers
66 views

Is there an efficient way to compute the “complete subset regression”?

Background: Let $X \in \mathbb{R}^{N\times K}$ and $y \in \mathbb{R}^{N\times 1}$ be data for a regression problem. The aim is to find $\beta \in \mathbb{R}^{K\times 1}$ such that $X\beta \approx y$ ...
2
votes
1answer
91 views

Linearly constrained eigenvalue problem

Suppose I'd like to: \begin{align} \mathop{\text{min}}_\mathbf{x} && \mathbf{x}^T\mathbf{A}\mathbf{x} \\ \text{subject to:} && \mathbf{x}^T \mathbf{M} \mathbf{x} = 1\\ && ...
1
vote
0answers
26 views

How to restructure adjacency matrix $A$ from shortest distance matrix $B$ in Network topology inference

An undirected graph with $n$ nodes could be referred to as an adjacency matrix $A$. $A=[a_{ij}]_{n×n}$ with $a_{ij}=a_{ji}=1$ standing for there being an edge between node $i$ and node $j$, and no ...
4
votes
1answer
118 views

Writing a complex orthogonal matrix as a conjugation by real orthogonal matrices

Let $Q\in O(n,\mathbb C)$ be a complex orthogonal matrix. I would like to know if $Q$ can always be written as $Q = T^{-1}ST$, where $T\in O(n,\mathbb R)\subset O(n,\mathbb C)$ and $S$ belongs to some ...
1
vote
1answer
57 views

Looking for algorithms based on sorting [closed]

i am looking for algorithms which use sorting in low-dimensional space like $R$ and how they are generalized for higher-dimensional spaces like $R^2$ where there is no sorting possible. (i.e. numbers ...
3
votes
2answers
105 views

eigenvalue estimate of the adjacency matrix

The adjacency matrix of a nonempty (undirected) graph has a strictly positive largest eigenvalue $\lambda_\max$. A very easy upper estimate for it can be obtained directly by Gershgorin's theorem: $$ ...
0
votes
1answer
260 views

Is there a Gröbner basis analogue that exists for vector spaces?

Suppose I have a coordinate system $t_1,\ldots t_N$ with a lexicographical ordering. Let LT denote choosing the lowest term of a polynomial with respect to this ordering. e.g. LT$(t_1 + t_2)=t_2$. ...
0
votes
2answers
107 views

Can any antilinear involution be trivialized by a change of basis?

Consider an antilinear involution, that is an antilinear map on a complex vector space, whose matrix $M$ obeys $MM^*=1$ where the star denotes complex conjugation. Can we find a change of basis whose ...
4
votes
1answer
218 views

Generalized Cauchy-Binet sum over a fixed subset of indices

I originally posted this on math.stackexchange, but it quickly got buried. I removed it not too long after, thinking of rewriting it for MO, but I didn’t have a chance to post it until now. Apologies ...
3
votes
2answers
142 views

Linearly independent family of sequences of rationals with a cardinal equal to the continuum

I'm coming back to this question. Is it possible to have "an explicit" linearly independent family of sequences of rationals with a cardinal equal to the continuum? PS: sorry for the duplicate on the ...
0
votes
0answers
55 views

The space of sequences of rationals and its dimension [duplicate]

In the following page, I give an example of a vector space not isomorphic to its double dual. I use the space $E$ of sequences of reals. Its dimension (over the field of the reals) is the one of the ...
2
votes
0answers
44 views

Random matrices whose limit gives exact Wigner surmise

Let $M$ come from an ensemble of $N\times N$ matrices. The Wigner surmise is density function $p^W_0(s)=\frac{\pi}{2}se^{-\pi s^2/4}$. From a random matrix point of view, we can write ...
1
vote
0answers
76 views

MInors related problem [closed]

A matrix $A$ has $m$ rows and $n$ colums, such that $m \leq n$. We know that each row of $A$ has the norm $1$ (the norm of an element $x=(x_1,x_2,...,x_n) \in \mathbb{R}^n$ is ...
5
votes
3answers
204 views

Why is the spectrum of this matrix product invariant with respect to order of the multiplicants?

I've been chewing on the following problem for some time and I just don't have any more ideas how to tackle it. I have matrices $A_1,...,A_k \in \mathbb R^{n\times n}$ and I'm observing that the ...
11
votes
1answer
212 views

Hlawka inequality for determinants of positive definite matrices

It is mentioned here that if $A, B, C\in M_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from this article) and the special case ($C=\bf 0$) ...
2
votes
0answers
160 views

Eigenvalues of this matrix

I have a linear map that is defined by $$T:\text{lin}(1,...,x^m) \rightarrow \text{lin}(1,...,x^m) \text{ with}$$ $$x^k \mapsto 2w(k-m)x^{k+1}+(k^2-k-w^2)x^k-2kwx^{k-1}+(k-k^2)x^{k-2}$$ Let me give a ...
7
votes
1answer
154 views

Compute only selected components of an eigenvector

I am wondering whether it is possible to compute portions of the eigenvectors of a given (possibly very big) matrix. More formally, consider the eigenvalue problem $\mathbf{Ax} = \lambda \mathbf{x}$, ...
4
votes
1answer
181 views

$n$ columns of a specific “infinite” Vandermonde matrix always linearly independent? [closed]

Consider the "infinite" Vandermonde matrix $$ V (x_1, x_2, \ldots , x_n) = \begin{pmatrix} 1 & x_1 & x_1^2 & \cdots & x_1^{n-1} & x_1^n & x_1^{n+1} & \cdots \\ ...
3
votes
1answer
97 views

Let $A\in\operatorname{M}_n(F)$ be a matrix, how to prove $\bigcap_{X\in C(A)}C(X)=F[A]=\frac{F[x]}{(m_A(x))}$

I asked the following question on Math Stack Exchange, but no people reply. I know MO is more professional and it is for mathematicians to discuss research problems. Maybe this question is unsuitable ...
-1
votes
1answer
87 views

Action of rotation group on Matrices [closed]

Is the following assertion true? Suppose $p, q \geq 3$. Consider the action of $SO(p,\mathbb{R})$ on $p \times q$ matrices by left multiplication. I want to show that $MA = A$, where $M \in ...
-3
votes
1answer
134 views

A problem that involves matrix and Lorentz Transformation [closed]

To be clear I address the question in two parts as below. All matrixes involved are real four-dimensional matrixes. $1.$Let $G$ be the matrix $diag(1,-1,-1,-1)$. $A$ is a matrix satisfying $A G ...
1
vote
1answer
79 views

Connection between eigenvalues of A and its LDL decomposition

Consider an undirected graph $G$ with $N$ vertices and its adjacency matrix $n_{ij}$: $n_{ij} = 1$ if vertices $i$ and $j$ are connected by an edge and $n_{ij} = 0$ otherwise. Consider $A_{ij} \equiv ...