Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
54 views

Independence-like property of convex combinations in a vector space

Consider the following property of a set of vectors $S\subset V$, where $V$ is a real vector space: $$ \sum_{i=1}^m w_ix_i = \sum_{i=1}^m u_iy_i,\quad x_i,y_i\in S,\quad 0\le w_i,u_i\le 1, \quad \...
user29985's user avatar
3 votes
0 answers
148 views

Spectrum of symmetric Toeplitz matrix

A matrix is Toeplitz if it is constant on the diagonals parallel to the main diagonal. I am looking for references on the spectrum of finite symmetric Toeplitz matrices over finite fields.
Patrick Sole's user avatar
3 votes
0 answers
39 views

A non-singularity property for sets of real matrices

Let $M_N(\mathbb{R})$ be the ring of $N\times N$ real matrices. We say that a couple $(\mathcal{U},\mathcal{V})$, with $\mathcal{U},\mathcal{V}\subseteq M_N(\mathbb{R})$ is admissible if, for every $A\...
Capublanca's user avatar
3 votes
0 answers
55 views

What is the precise definition of a quadratic form of Minkowski type (in the infinite case)?

I've been trying to understand a construction in the paper "Degree Growth of Meromorphic Surface Maps" by Bouksom, Favre and Jonsson. In it they state, In fact, the completion can be characterized ...
man o shadow's user avatar
3 votes
0 answers
180 views

Automorphisms of infinite matrix algebra

This is a similar question to one that I posted in MSE a few days ago. I recently came across this paper from Alahmedi, Alsulami, Jain and Zelmanov, which quoted the following result for $M_\infty(K)$...
dbossaller's user avatar
3 votes
0 answers
360 views

Do we know what the impulse to "introduce" the Jordan canonical form was?

Mo-ers, Do you know how it was that the study of the Jordan canonical form began? There are certain things that may be said once one has thought about the matter: for instance, one can say that the ...
Jamai-Con's user avatar
3 votes
0 answers
122 views

Algebra of block matrices with scalar diagonals

I am interested in block matrices $A$, that is $A\in M_{n\times n}(R)$ where $R=M_{s\times s}(k)$ and $k$ is a field, such that for every positive integer $m$ the matrix $A^m$ has only scalar blocks ...
Adam Przeździecki's user avatar
3 votes
0 answers
114 views

Jacobian of the action of a matrix on a Grassmannian

I'm looking for a reference concerning a calculation found in Furstenberg's 1963 paper "Non-commuting random products". Lemma 8.8 of this paper states that if one takes a $d\times d$ invertible real ...
Pablo Lessa's user avatar
  • 4,304
3 votes
0 answers
105 views

Can one do better than using general purpose determinant algorithms when using the Fisher-Kasteleyn-Temperley method for perfect matchings?

Questions. (numerical.generalPfaffian) Is it proved anywhere that in general it is not easier0 to calculate the determinant (over $\mathbb{Q}$) of the skew-symmetric signed adjacency matrix defined ...
Peter Heinig's user avatar
  • 6,051
3 votes
0 answers
43 views

Sequence of neighboring orthogonal vectors

Let $v_1v_2...v_n$ be a sequence of vectors in $\mathbb{F}_2^{m}$. We say that this sequence is neighboring orthogonal if $\langle v_i, v_{i+1}\rangle = 0$ for each $i\in \{1,...,n\}$, where for each $...
verifying's user avatar
  • 311
3 votes
0 answers
174 views

Reference for a statement about upper triangular unipotent matrices

I am revising a paper, and a referee of that paper asked if the following little lemma we proved there is known: ``Let $X$ be an $n\times n$ upper triangular unipotent matrix over $\mathbb R$. There ...
WKC's user avatar
  • 646
3 votes
0 answers
119 views

Increasing sequence of closed subspaces of $L^2$ and error estimate of a product of orthogonal projections

We define an increasing sequence of closed subspaces \begin{align*} V_{0} \subset V_{1} \subset V_{\ell} \subset \dots \end{align*} of $L^2(I)$ where $I=(0,x_{max})$, and each $V_{\ell}$ is equipped ...
user144209's user avatar
3 votes
0 answers
130 views

Where does this identity involving sums of Hankel-like determinants over partitions come from?

For a partition $\lambda=( \lambda_1,\dots,\lambda_n)\vdash n$ with $\lambda_1\ge\dots\ge\lambda_n\ge0$ and any function $f:\mathbb Z\to\mathbb C$, define a Hankel-like $n\times n$ matrix $$M_f(\...
Wolfgang's user avatar
  • 13.4k
2 votes
1 answer
460 views

Maximum permuted row/column sum of a matrix

Given a real $n \times n$ matrix $A$ (feel free to assume its entries are non-negative, if it helps), what is known about the problem of computing the quantity $$ \max_{\sigma \in S_n} \left\{\sum_{j=...
Nathaniel Johnston's user avatar
2 votes
1 answer
553 views

Upper Bounds on the Largest Eigenvalue of Jacobi Matrices

Suppose I have a symmetric tridiagonal (Jacobi) matrix in the following form: $ \begin{pmatrix} 1 & a_{1} & 0 & ... & 0 \\\ a_{1} & 1 & a_{2} & & ... \\\ 0 & a_{...
Taha's user avatar
  • 137
2 votes
2 answers
3k views

Statement of Lagrange's theorem on determinants(elementary question).

Apologies for this elementary question; but I was unable to find a reference otherwise. Let $A, B, C$ be square matrices of the same dimension. Then, $$\begin{vmatrix} A & C \\\ 0 & B \end{...
Anweshi's user avatar
  • 7,442
2 votes
3 answers
1k views

On certain decomposition of unitary symmetric matrices

This is by any means elementary, but since I have asked this question on Stark Exchange but received no satisfactory answers I decide to post it here. It is well known that a symmetric matrix over ...
Zhang Xiao's user avatar
2 votes
1 answer
810 views

On matrices that almost have the same eigenvalues

Let $A$ and $B$ be two $4\times 4$ matrices. Using Newton's identities, one can prove that if $$\det(A) = \det(B)\quad \text{and}\quad \mathrm{tr}(A^i) = \mathrm{tr}(B^i)$$ for $i=1,2,3$, then $A$ and ...
Malik Younsi's user avatar
  • 2,154
2 votes
1 answer
316 views

Decomposition of Hilbert spaces via groups and algebras representations

Let $\mathcal{H}$ be a complex finite dimensional Hilbert space and let $\mathcal{A}\subseteq \mathcal{B}(\mathcal{H})$. I am looking to understand the different decompositions of $\mathcal{H}$ ...
vand's user avatar
  • 23
2 votes
1 answer
223 views

Minimal Support Solutions of a Linear System (Dissertation)

For a given $n \times m$ matrix A with $m>>n$ and a given vector $\vec b \in \mathbb{F}^{n \times 1}$, and given that $A\vec{x}=\vec{b}$ for at least one $\vec{x} \in \mathbb{F}^{m \times 1}$, ...
Thomas Rasberry's user avatar
2 votes
2 answers
654 views

Looking for a reference: double orthogonal complement in $(\mathbb{Z}/q\mathbb{Z})^n$

I'm using the following result in a computer science paper: Let $V$ be a submodule of $(\mathbb{Z}/q\mathbb{Z})^n$ (n-tuples with addition and multiplication mod $q$). Let $$V^\perp = \{u \in (\...
Michael Blondin's user avatar
2 votes
2 answers
248 views

On an angle distribution of a random linear subspace of a given dimension

$\newcommand\R{\mathbb R}$ Let $u$ be a fixed unit vector in $\R^n$, and let $\Pi_u$ be the hyperplane in $\R^n$ with normal vector $u$. Let $B$ be the (say open) unit ball in $\R^n$ centered at the ...
Iosif Pinelis's user avatar
2 votes
1 answer
217 views

Diagonalising a symmetric matrix with polynomial entries

Suppose I have a symmetric $2$ by $2$ matrix $M$ whose $(i,j)$-th entry $F_{i,j}(\mathbf{x})$ belongs to $\mathbb{R}[x_1, \ldots, x_n]$ for each $i,j$. I know that for each $\mathbf{x} \in \mathbb{R}^...
Johnny T.'s user avatar
  • 3,625
2 votes
2 answers
297 views

Looking for (information about) long diamonds

I was given an open problem as a birthday present recently. While I can probably handle spoilers at this point, what I really want are literature and other references. Also acceptable would be ...
Gerhard Paseman's user avatar
2 votes
1 answer
223 views

Linearly independent vectors from a family of subspaces

For the proof of a certain combinatorial statement on subsets of ${\mathbb F}_2^n$ in a paper I and several other people are working on, the following statement was helpful. Proposition. Let $V$ be a ...
Michael Stoll's user avatar
2 votes
1 answer
743 views

rank of a linear combination of matrices

Let $A_1,..., A_s \in M_n(\mathbb{R})$ be symmetric matrices and suppose they are linearly independent over $\mathbb{R}$. This means that $$ m = \min_{(c_1, ..., c_s) \in \mathbb{R}^s \backslash \{0\}}...
Johnny T.'s user avatar
  • 3,625
2 votes
2 answers
3k views

Linear programming with infinitely many constraints

I wish to study the following linear program $$\begin{array}{ll} \text{minimize} & \mathrm c^{\top} \mathrm x\\ \text{subject to} & \mathrm A \mathrm x = \mathrm b\\ & \mathrm x \geq 0\...
user3433489's user avatar
2 votes
1 answer
306 views

distance from the mean of a normal distribution to the span of a random sample

Let $W$ be a $d\times k$ matrix whose columns are sampled from a multivariate normal distribution with mean $\mu$ and unit covariance. I'm interested in $|\mu - WW^+\mu|$, that is the distance from ...
Mike Izbicki's user avatar
2 votes
1 answer
520 views

Neighborhood overlap matrix for a bipartite graph

Let $G$ be an undirected, simple, bipartite graph with parts $V$ (having $n$ vertices) and $W$ (having $m$ vertices). Define the following $n$-by-$n$ matrix: for any $i,j \in V$, $$a_{ij} = |N_i \cap ...
Ben Golub's user avatar
  • 1,068
2 votes
1 answer
255 views

Efficient algorithm for solving a convex quadratic program [duplicate]

Let $A \in \mathbb{R}^{n \times m}$ and $b \in \mathbb{R}^n$. Suppose $m \ll n$. How to solve this quadratic program efficiently? $$\min_{x \in \mathbb{R}^n} \frac{1}{2} x^\top AA^\top x + b^\top x$$
O. Richard's user avatar
2 votes
2 answers
446 views

Entrywise modulus matrix and the largest eigenvector

Disclaimer. This is a cross-post from math.SE where I asked a variant of this question two days ago which has been positively received but not has not received any answers. Let $A$ be a complex ...
Julian's user avatar
  • 623
2 votes
1 answer
325 views

Determinant and inverse of a "stars and stripes" matrix

This is a variant of another MO question. Consider the matrix $$M_n:=\begin{bmatrix}c_1& a & b&a& \ddots & a \\ b & c_2 & a& b&\ddots & b\\ a & b & c_3&...
Wolfgang's user avatar
  • 13.4k
2 votes
1 answer
668 views

Elementary bound on operator norm on symmetric tensors: reference request

My education didn't really cover Tensors very well, so I'm getting stumped by a quite elementary question. Let $T_k$ be a type k symmetric tensor. We can define the "operator norm" (or the induced ...
Guillaume Dehaene's user avatar
2 votes
1 answer
336 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 ...
Manfred Weis's user avatar
  • 13.2k
2 votes
1 answer
162 views

'Compute' Integral equivalence of matrices

Hi. For a matrix $D \in \mathbb{Z}^{n \times n}$ and a symmetric, positive definite integral even matrix $S \in \mathbb{Z}^{n \times n}$ put $S[D] := D^TSD$ where the $\cdot^T$ means 'transposed'. ...
Fabian Werner's user avatar
2 votes
0 answers
269 views

Singular values of Kronecker product of random matrices

I'm looking for a way to evaluate $\mathbb{E} \| (\mathbf{X} \mathbf{Q})^+ \|$ for a random matrix $\mathbf{X} \in \mathbb{R}^{r \times n}$ and a (fixed) matrix $\mathbf{Q} \in \mathbb{R}^{n \times \...
Uria Mor's user avatar
  • 121
2 votes
1 answer
358 views

q-polynomials in terms of a basis

Consider the polynomials $$f_n(q)=\prod_{j=1}^n(1+q^j) \qquad \text{and} \qquad g_m(q)=1+q+q^2+\cdots+q^m.$$ I'll list a few examples to motivate my question. Direct calculations show that $$f_1=g_1, \...
T. Amdeberhan's user avatar
2 votes
0 answers
76 views

Periodic orbits of generalized cat map near the origin

Let $M\in SL(2,\mathbb{Z})$ have eigenvalues $\lambda, \lambda^{-1}$ with $\lambda>1$., and suppose $M$ is diagonalized as $Q\Lambda Q^{-1}$ with $\det Q=1$. (Note that his doesn't determine $Q$, ...
Yonah Borns-Weil's user avatar
2 votes
0 answers
99 views

When does a matrix subspace contain a full rank matrix?

Cross-posted at Math SE Let $S\subseteq M_{n,m}(\mathbb{C})$ be a $d$-dimensional subspace of the space of $n\times m$ complex matrices (with $n\leq m$, say). I am interested in figuring out ...
mathwizard's user avatar
2 votes
0 answers
98 views

Sublattices in the standard integral symplectic lattice

Let $V$ denote $\mathbb{Z}^{2g}$ with its standard integral symplectic form $\omega = \sum_{i=0}^{g-1}dx_{2i} \wedge dx_{2i+1}$ (or, the homology lattice of a genus $g$ surface with its intersection ...
Rodion N. Déev's user avatar
2 votes
0 answers
131 views

Pfaffian generalization

The identity $$\left| \begin{array}{cccc} x & y_1 & y_2 & y_3 \\ z_1 & 0 & a & b \\ z_2 & -a & 0 & c \\ z_3 & -b & -c & 0 \\ \end{array} \right|=\...
Alexey Ustinov's user avatar
2 votes
0 answers
1k views

Applications of linear algebra in the design of aircraft [closed]

David Lay mentioned one application of linear algebra in the design of aircraft in the introductory part of chapter 2 of his book: [...] A computer creates a model of the surface by first ...
student's user avatar
  • 101
2 votes
0 answers
148 views

Generalization of Farkas' Lemma to Hermitian Matrices

I recently stumbled upon a well-known version of Farkas' Lemma which, roughly speaking, I would like to generalize from real vectors to hermitian matrices, as it seems promising for something else I ...
Frederik vom Ende's user avatar
2 votes
0 answers
55 views

Lower bounds on eigenvalues of Lyapunov solutions

Let $A\in\mathbb{R}^{n\times n}$, $B\in\mathbb{R}^{n\times m}$ and let $X\in\mathbb{R}^{n\times n}$, $X=X^\top>0$ be the solution of the following Lyapunov algebraic equation $$ AX+XA^\top=-BB^\top....
Ludwig's user avatar
  • 2,712
2 votes
0 answers
275 views

Maximum spectral norm of matrices with given anti-Hermitian part and Hermitian part's spectrum

Let $M\in M_n(\mathbb C)$ be a $n\times n$ matrix over the complex field. It can be written uniquely as $M=H+A$, where $H=H^*$ denotes its Hermitian part and $A=-A^*$ its anti-Hermitian part. Its ...
francesco999's user avatar
2 votes
0 answers
102 views

Eigenvalue distribution for a real-valued random matrix with correlated Gaussian entries

I'm working on an application where I would greatly benefit from knowing the distributions of the eigenvalues of a real-valued random matrix whose elements can be assumed to be Gaussian, but where I ...
Ian Cero's user avatar
  • 121
2 votes
0 answers
29 views

Terminology question- Antihermitian elements

Let $V$ be a vector-space over a field $F$, and let $B$ be a non-degenerate bilinear form on $V$. Question: Is there a common term to call an operator $x\in End(V)$ satisfying $$B(xu,v)+B(u,xv)=0\...
kneidell's user avatar
  • 993
2 votes
0 answers
181 views

Size of Jordan blocks under random perturbations

Let $A \in \mathbb{C}^{n \times n}$ be some (fixed) matrix with eigenvalues $\lambda_{1},\ldots,\lambda_{n}$. Let $E$ be some random, small-normed, perturbation such that $\tilde{A} = A+E$ has ...
Daniel86's user avatar
  • 225
2 votes
0 answers
764 views

Reference: Continuity of Eigenvectors [closed]

I am looking for an appropriate reference for the following fact. I already posted on math.stackexchange, but got no answer. For each $X \in \mathbb{R}^{n \times n}_{\text{sym}}$ (symmetric matrix),...
gerw's user avatar
  • 1,724
2 votes
0 answers
1k views

Good sources for linear algebra for convex optimization and graph analysis?

What are some good sources for linear algebra for convex optimization and graph analysis? In Particular, is Gilbert Strang's MIT course suitable, or some other online course? I prefer online courses (...
DoubleJay's user avatar
  • 2,383

1
3 4
5
6 7