Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
715 views

Find a matrix's nullspace from submatrix nullspace

This is probably a basic question, but my linear algebra is weak. Suppose I want to compute the nullspace of a matrix A using some iterative method (e.g. Lanczos). Suppose further that I know a ...
Robert Holmes's user avatar
9 votes
2 answers
2k views

Jordan Form Over a Polynomial Ring

Let $X$ be the set of $k\times k$ matrix with entries in $\mathbb{C}$, and let $M\in X$. The group $GL(k,\mathbb{C})$ acts on $X$ by conjugation, and according to the Jordan decomposition theorem (...
Clay Cordova's user avatar
  • 2,087
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
3 votes
1 answer
632 views

What is the entropy of a density matrix which is the sum of two unitarily equivalent projectors?

Construction Suppose I have a density matrix $\rho$ which is proportional to a projector $P$ formed by tensoring together $N$ small projectors $P^{(i)}$ of rank 2: $P^{(i)} = |a\rangle_i\langle a| + |...
Jess Riedel's user avatar
1 vote
2 answers
917 views

Any known compact expression for

Is there any known compact expression for the sum $$S_{k} = \sum_{i=1}^{k} A^{i-1} P Q^{k-i}$$ where $A$, $P$ and $Q$ are respectively $m \times m$, $m \times n$ and $n \times n$ matrices?. You can ...
Jorge's user avatar
  • 61
4 votes
1 answer
866 views

When is a triangular matrix totally unimodular?

I have a {0,1}, invertible, triangular matrix, that I would like to show is totally unimodular. Are there any known results on the total unimodularity of classes of triangular matrices?
Michael Biro's user avatar
  • 1,182
22 votes
3 answers
3k views

Splitting the determinant polynomial into linear factors - a Dedekind problem

Here's the question in a nutshell. For some $n\in\mathbb N$, we consider the polynomial $\det\left(\left(X_{i,j}\right) _ {1\leq i\leq n,\ 1\leq j\leq n}\right)\in\mathbb Z\left[X_{i,j}\mid 1\leq i\...
darij grinberg's user avatar
-4 votes
2 answers
6k views

Factorizing polynomials of several variables (in a different perespective)

I am looking for factorization of polynomials of several variables in the way outlined below. Consider a second degree polynomial of two variables over the complex numbers. "P(x,y) = Ax^2 + Bxy + Cy^...
1 vote
1 answer
356 views

Finding the $J$ for a symplectic vector space

I found something strange when I was working on some other problems. I thought the triple intersection description of the unitary group said that any two of $(g, \omega, J)$ determines the third ...
Bo Peng's user avatar
  • 1,525
11 votes
1 answer
688 views

Existence of a pair of matrices in SL(2,Z) satisfying certain constraints on the spectral radius

Some background: my coauthors and I are working on a problem which deals with the exponential growth rates of certain infinite products of matrices. One of the sub-problems which arises in this ...
Ian Morris's user avatar
  • 6,206
2 votes
0 answers
5k views

A system of linear equations with linear constraints

Mathematical problem. Suppose we have $2n$ indeterminates $x_1,\dots,x_n$ and $y_1,\dots,y_n$ (which are denoted by $q$ with indices and called abundances below) and $m$ subsets $P_1,\dots,P_m$ of $\...
Florian Breitwieser's user avatar
14 votes
2 answers
937 views

Involutions in GL_n(Z)

Is there a classification of involutions in $\text{GL}_n(\mathbb{Z})$? Here's some more details about what I mean. Consider $f \in \text{GL}_n(\mathbb{Z})$ such that $f^2=1$. Regard $f$ as an ...
New to this's user avatar
8 votes
2 answers
3k views

Centralizers in GL(n,p)

There appear to be a number of rational canonical forms. The best thing about standards is how many there are to choose from. However, the standard I choose seems to have a centralizer that is ...
Jack Schmidt's user avatar
  • 10.7k
4 votes
0 answers
790 views

Is it possible to use linear programming to solve this problem?

I am trying to write software to minimize pricing for cell phone subscription services, ie: choose the optimum plan for each customer in a large group. Could someone comment on whether this is ...
user6546's user avatar
13 votes
4 answers
2k views

Rational congruence of binomial coefficient matrices

Skip Garibaldi asks if there is an elementary proof of the following fact that "accidentally" fell out of some high-powered machinery he was working on. Say that two matrices $A$ and $B$ over the ...
Timothy Chow's user avatar
  • 82.7k
4 votes
2 answers
1k views

Simultaneous Block decomposition of a set of orthogonal projections

An orthogonal projection is an Hermitian matrix $P$ such that $P^2=P$. Denote $U^*$ the conjugate transpose of a matrix $U$. It can be easily shown that for two projections $P_1$ and $P_2$, there ...
Mateus de Oliveira's user avatar
9 votes
3 answers
4k views

Eigenvectors of a certain big upper triangular matrix

I'm looking at this matrix: $$ \begin{pmatrix} 1 & 1/2 & 1/8 & 1/48 & 1/384 & \dots \\ 0 & 1/2 & 1/4 & 1/16 & 1/96 & \dots \\ 0 & 0 & 1/8 & 1/16 &...
Michael Hardy's user avatar
2 votes
1 answer
455 views

A question on matrix decomposition.

Is the following claim true? Claim Let $A, B\in C^{n\times n}$ with $rank(A)=rank(B)=r$. Then there exist nonsingular matrices $P_1, P_2, Q_1, Q_2$ such that $$ Q_1AP_1=Q_2BP_2=\left(\begin{array}{...
Sunni's user avatar
  • 1,858
0 votes
2 answers
579 views

Linear algebra inequality

I'm wondering (hoping) if an inequality is true. Please can anyone help me? Let $V$ be a complex vector space $dim_{\mathbb{C}}(V)=n$ with a hermitian scalar product $h$. Let $v,a, b \in V$. Is it ...
Italo's user avatar
  • 1,727
12 votes
0 answers
349 views

Matroids with prescribed independent sets

Let $A$ be a finite set. Let $B$ be a family of subsets of $A$. We are interested in a matroid with a minimum rank such that every element of $B$ is independent. The answer is obvious - a uniform ...
ilyaraz's user avatar
  • 1,791
15 votes
9 answers
9k views

Exponential of large matrices

I want to make a diffusion kernel, which involves $e^{\beta A}$, where A is a large matrix (25k by 25k). It is an adjacency matrix, so it's symmetric and very sparse. Does anyone have a ...
Xodarap's user avatar
  • 151
4 votes
2 answers
16k views

Submultiplicative matrix norm: Max Norm

Various sources claim that a maximum norm $||A||_{max}=\max_{i,j}|a_{ij}|$ is not submultiplicative, i.e. $||AB||_{max}\not\leq||A||_{max}||B||_{max}$. Where can I find what norm a,b satisfy $||AB||...
user6358's user avatar
3 votes
2 answers
2k views

How can we explicitly find the maximum eigenvalue of a tridiagonal matrix?

I just came across a matrix of the form $A:=\begin{pmatrix} 0&-\frac{c_0}{b_0}&0&\cdots&0\\-\frac{a_1}{b_1}&0&-\frac{c_1}{b_1}&\cdots&0\\0&-\frac{a_2}{b_2}&0&...
user6358's user avatar
5 votes
1 answer
745 views

Decide how many non-negative solutions a set of multivariate quadratic equations have

Given a set of multivariate, quadratic, non-homogeneous equations, is there a way to decide how many non-negative roots it have? Some explanations: All the coefficients are real numbers. The number ...
D.F.J.'s user avatar
  • 183
8 votes
3 answers
414 views

What can be said about pairs of matrices P,Q that satisfies $(P^{-1})^T \circ P = (Q^{-1})^T \circ Q$ ?

Let $P,Q$ be $n$ by $n$ invertible matrices. Suppose further that $P$ and $Q$ satisfies the following equation : $$(P^{-1})^T \circ P = (Q^{-1})^T \circ Q$$ where $\circ$ denotes the Hadamard matrix ...
Malik Younsi's user avatar
  • 2,154
3 votes
2 answers
1k views

"Main" diagonal of a matrix

Hello! I'm in search of some (possibly statistical) measure for matrices. I want to classify a square matrix as having the largest numbers running along the main diagonal or along the anitdiagonal. ...
Verhoevenv's user avatar
2 votes
0 answers
156 views

A solver of a noisy system containing pairs of very similar linear equations, this is not about accurate solving of ill-cond. s.

Let there be a possibly overdetermined system AX = B, where B are some measured data, with a low noise level. To cancel out the measurement noise, and to allow for more unknowns, a large B is acquired,...
arataj's user avatar
  • 21
17 votes
4 answers
10k views

Prime/undecomposable matrices

Prime matrices as defined in the following paper Prime matrices P. F. RIVETT AND N. I. P. MACKINNON carry over many properties of factorization as in natural numbers to matrices over the field of ...
Unknown's user avatar
  • 2,855
9 votes
2 answers
2k views

Classification of adjoint orbits for orthogonal and symplectic Lie algebras?

This might be standard, but I have not seen it before: Let $K$ be an algebraically closed field (of characteristic 0 if necessary). Let $G$ be the orthogonal group ${\bf O}(m)$ or the symplectic ...
Steven Sam's user avatar
  • 10.7k
2 votes
3 answers
806 views

An Linear Algebra Inequality

How to prove the following inequality: Let $X$ and $Y$ be $n\times m$ matrices with real entries. Prove that \begin{equation} \det\left(XY^T\right)^2 \leq \det\left(XX^T\right)\det\left(YY^T\right) . \...
Marine's user avatar
  • 31
13 votes
2 answers
8k views

AC in group isomorphism between R and R^2

Using the axiom of choice, one can show that $\mathbb{R}$ and $\mathbb{R}^2$ are isomorphic as additive groups. In particular, they are both vector spaces over $\mathbb{Q}$ and AC gives bases of ...
Noah Stein's user avatar
  • 8,491
2 votes
1 answer
987 views

Surjectivity of bilinear forms.

It is not uncommon to describe interesting classes of field extensions by declaring that an extension $L|K$ belongs to that class if some type of problem with $K$-coefficiens has a property over $L$ ...
Xandi Tuni's user avatar
  • 4,015
12 votes
2 answers
2k views

(Path) connected set of matrices?

Let $N \in \mathfrak{M}_n(\mathbb{C})$ nilpotent, such that there exists $X \in \mathfrak M_n(\mathbb{C})$ with $X^2=N$ (take for instance $n>2$ and $N(1,n)=1$; $N(i,j)=0$ otherwise). Denote by $\...
Portland's user avatar
  • 2,829
5 votes
1 answer
3k views

Finite subgroups of GL_n(C)

A finite groups of $\mathrm{GL}_n(\mathbb C)$ of exponent $m$ necessarily have order $C$ verifying $C\leqslant m^n$ and $n! m^n$ divides $C$, but this condition is not sufficient, for instance $\...
Portland's user avatar
  • 2,829
2 votes
3 answers
1k views

Problem with the proof of a corollary of Schur's lemma

I'm reading the book 'A course in Modern Mathematical Physics' by 'Szekeres' and encountered a problem in interpreting the proof of the following corollary of Schur's lemma. The corollary and the ...
Marc Mertens's user avatar
2 votes
3 answers
2k views

free Z-modules: Bases etc.

I need a reference which states which of the "normal properties of vector spaces" carry over to free $\mathbb{Z}$-modules. Especially I am interested in things like: If you have a linear map between ...
J Fabian Meier's user avatar
21 votes
9 answers
19k views

What is the best algorithm to find the smallest nonzero Eigenvalue of a symmetric matrix?

see title. An algorithm is 'good' if it is able to distinguish between zero Eigenvalues and nonzero Eigenvalues.
Philipp's user avatar
  • 979
2 votes
2 answers
3k views

Multiple outliers for two variable linear regression

Problem Visually, the "extreme" outliers in the following graph are somewhat obvious: Question Given: T - Set of all temperatures Y - Set of all years ΣT - Sum of temperatures. ΣY - Sum of years. ...
Dave Jarvis's user avatar
8 votes
4 answers
7k views

Positive solutions of linear Diophantine equations

Let $A$ be a non-negative integer $k\times n$-matrix (i.e. each entry is non-negative and integer) with $rank(A) = k < n$. Let $b$ be a $k$-dimensional vector with positive integer entries. ...
SIB's user avatar
  • 351
1 vote
1 answer
369 views

A matrix with trace entries.

This question is related to On a positivity of a matrix with trace entries. Let $A_1, \cdots, A_m$ be strictly contractive $n\times n$ complex matrices .Is it true that $$\left(\begin{array}{cccc}Tr\...
Sunni's user avatar
  • 1,858
13 votes
2 answers
1k views

Combinatorial proof of (a special case of) the spectral theorem?

The spectral theorem for a real $n \times n$ symmetric matrix $A$ says that $A$ is diagonalizable with all eigenvalues real. If $A$ happens to have non-negative integer entries, it can be interpreted ...
Qiaochu Yuan's user avatar
22 votes
1 answer
13k views

Non-diagonalizable complex symmetric matrix

This is a question in elementary linear algebra, though I hope it's not so trivial to be closed. Real symmetric matrices, complex hermitian matrices, unitary matrices, and complex matrices with ...
Qfwfq's user avatar
  • 23.3k
4 votes
1 answer
938 views

Random projection and finite fields

Suppose we have, say, $n$ $2n$-dimensional linearly independent vectors over $\mathbb{F}_2$. We do a projection on a random $d$-dimensional subspace. We are interested in probability that images of ...
ilyaraz's user avatar
  • 1,791
5 votes
1 answer
941 views

What is a concomitant (and other questions on D.E. Littlewood's "Products and plethysms of characters with orthogonal, symplectic, and symmetric groups" )?

I'm trying to understand the paper "Products and plethysms of characters with orthogonal, symplectic, and symmetric groups" by D.E. Littlewood (link), but I'm having trouble overcoming the language ...
Steven Sam's user avatar
  • 10.7k
7 votes
1 answer
347 views

Nonexistence of determinantal functional equation for $\arccos$

Suppose I have distinct real numbers $a_i \in [-1,1]$, $i \in [k]$. I want to choose real numbers $b_j, j\in [k]$ such that the matrix $(\arccos(a_i b_j))_{i,j \in [k]}$ is nonsingular. Is this ...
Jonah Blasiak's user avatar
68 votes
4 answers
9k views

explicit big linearly independent sets

In the following, I use the word "explicit" in the following sense: No choices of bases (of vector spaces or field extensions), non-principal ultrafilters or alike which exist only by Zorn's Lemma (or ...
Martin Brandenburg's user avatar
-3 votes
1 answer
3k views

Are there infinitely many equivalence classes of similar matrices? [closed]

It is easy to show that similarity in matrices is an equivalence relation (two matrices A and B of same size being similar if there exists a matrix P such that B = PAP^(-1) ) Moreover, given a matrix, ...
Unknown's user avatar
  • 2,855
14 votes
3 answers
872 views

How can we realize different combinatorial objects as the dimension of a construction on vector spaces? Are the resulting algebras useful?

Fix a vector space $V$ of dimension $n$ over some field $F$. Here are three commonly seen constructions: its $k$th tensor power, $T^kV$, which has dimension $n^k$ its $k$th exterior power, $\Lambda^k(...
Zev Chonoles's user avatar
  • 6,792
0 votes
1 answer
406 views

Operation of GL_n(Z/bZ) [closed]

I want to show, that $GL_n(\mathbb{Z}/b\mathbb{Z})$ operates transitively on $X = \{ (v_1, \ldots, v_n) \in (\mathbb{Z}/b\mathbb{Z})^n \ | \ v_1\mathbb{Z}/b\mathbb{Z} + \ldots + v_n\mathbb{Z}/b\...
sci's user avatar
  • 3
9 votes
1 answer
439 views

Connected subset of matrices ?

Let $m,n$ be positive integers with $m \leqslant n$, and denote by $\mu_M$ the minimal polynomial of a matrix. Do we know for which $m$ the set $E_m$ of $M \in \mathfrak{M}_n(\mathbb{R})$ such that $\...
Portland's user avatar
  • 2,829

1
115 116
117
118 119
121