Skip to main content

All Questions

Filter by
Sorted by
Tagged with
12 votes
2 answers
743 views

Smallest set such that all arithmetic progression will always contain at least a number in a set

Let $S= \left\{ 1,2,3,...,100 \right\}$ be a set of positive integers from $1$ to $100$. Let $P$ be a subset of $S$ such that any arithmetic progression of length 10 consisting of numbers in $S$ will ...
color's user avatar
  • 179
12 votes
4 answers
2k views

Finite subgroups of $PGL_2(K)$ in characteristic $p$

Let $K$ be a field of characteristic $p$. What are the finite subgroups of $PGL_2(K)$ whose orders are divisible by $p$? And if $G$ and $H$ are two such subgroups that are isomorphic, can one say when ...
Xander Faber's user avatar
  • 1,199
12 votes
3 answers
2k views

Representability of matroids over $\mathbb R$

Let $M$ be a matroid, for example viewed as being given by a finite set $X$ and a rank function $d : P(X) \to {\mathbb N}$ such that 1) $d(\varnothing)=0$, $d(\lbrace x \rbrace)=1$, for all $x \in X$,...
Andreas Thom's user avatar
  • 25.5k
12 votes
2 answers
1k views

Eigenvalue perturbation theory via Feynman diagrams

Suppose I have a matrix given by a sum $$A=D+\epsilon B$$ where $D$ is diagonal and $\epsilon$ is small, and I want the eigenvalues of $A$ as a power series in $\epsilon$. The first two orders in ...
thedude's user avatar
  • 1,549
12 votes
1 answer
902 views

Positive 4-form

Denote by $W$ the space of all symmetric bilinear forms on $\mathbb{R}^n$. Let $Q$ be a quadratic form on $W$. Suppose that $Q(b)\geqslant 0$ for any $b\in W$ such that $b(X,Y)=\ell(X)\cdot\ell(Y)$ ...
Anton Petrunin's user avatar
12 votes
3 answers
3k views

elementwise functions of positive definite matrix

The fact that the Schur (that is, element wise) product of two positive definite (symmetric) matrices is positive definite immediately implies (using the convexity of the positive semi definite cone) ...
Igor Rivin's user avatar
  • 96.4k
12 votes
4 answers
1k views

Topologizing free abelian groups

For any set $S$ one can consider the free abelian group $\mathbb{Z}[S]$ generated by this set. Now suppose, there is a topology on $S$ given. Is it possible to find a topology on $\mathbb{Z}[S]$ in ...
HenrikRüping's user avatar
12 votes
2 answers
2k views

What is known about the eigenvectors of the $2^n \times 2^n$ Hadamard matrix?

What is known about the eigenvectors of the $2^n \times 2^n$ Hadamard matrix defined recursively by $H_1=(1)$ and $$ H_N=\begin{pmatrix}H_{N/2} & H_{N/2} \\ H_{N/2} & -H_{N/2}\end{pmatrix}, $$ ...
MCH's user avatar
  • 1,324
12 votes
4 answers
1k views

Real and quaternionic representations according to weights

According to this question, it is easy to know whether a (complex, finite-dimensional) representation is self-dual or not: just check if the weight distribution in space is symmetric about the origin. ...
Jjm's user avatar
  • 2,091
12 votes
5 answers
6k views

Infinite direct product of the integers not a free module over the integers [duplicate]

Possible Duplicate: Is it true that, as Z-modules, the polynomial ring and the power series ring over integers are dual to each other? Is there an easy proof? I only found citations but have no ...
Horst Fickenscher's user avatar
12 votes
5 answers
2k views

Analogue of Cayley Hamilton theorem for operators on Hilbert space

Is there an analogue of Cayley Hamilton theorem which holds for operators on a separable Hilbert space. Obviously the characteristic polynomial will be replaced by something else.
Benjamin's user avatar
  • 2,099
12 votes
1 answer
5k views

Closest 3D rotation matrix in the Frobenius norm sense

Given a 3 by 3 matrix $M$ I would like to find the rotation matrix $R$ minimizing the Frobenius norm: \begin{equation} \|R-M\|_F \end{equation} Is there a closed form solution for $R$, or is it ...
Alex Flint's user avatar
12 votes
2 answers
3k views

On the positive definiteness of a linear combination of matrices

In my work in PDE, the following problem in linear algebra came up. Any help in this direction is appreciated. QUESTION: Let $m,n\in\mathbb{N}$ and let $A_1,\ldots, A_m\in M_n(\mathbb{R})$ be real, ...
Tatin's user avatar
  • 895
12 votes
2 answers
970 views

which norms can be realized as operator norms?

Assume $(V,∥∥_V),(W,∥∥_W)$ are both finite dimensional normed spaces. We have the induced operator norm on ${\rm Hom}(V,W)$. It turns out that the operator norm is induced by an inner product iff ...
Asaf Shachar's user avatar
  • 6,741
12 votes
4 answers
752 views

Additive commutators and trace over a PID

I would like to find an example of principal ideal domain $R$, such that there exists a square matrix $A\in \mathfrak{M}_n(R)$ with zero trace that is not a commutator (i.e. for all $B,C \in \mathfrak{...
Portland's user avatar
  • 2,829
12 votes
2 answers
2k views

Non-degenerate multilinear forms

Is there a standard notion of non-degeneracy for multilinear forms? My motivation is simple curiosity, by the way!
Mariano Suárez-Álvarez's user avatar
12 votes
2 answers
5k views

Why Householder reflection is better than Givens rotation in dense linear algebra?

It’s obvious that Givens rotation works better with sparse matrices. But I don’t know why Householder reflection is better for dense matrices. Does it require less computations? Or it’s numerically ...
lino's user avatar
  • 253
12 votes
2 answers
1k views

Quadratic Farkas' Lemma?

The Farkas Lemma says that if a system of linear inequalities implies yet another linear inequality, then this last inequality can be obtained by taking a positive linear combination of the ...
Seva's user avatar
  • 23.1k
12 votes
5 answers
9k views

Solving Lyapunov-like equation

The following matrix equation might be a Lyapunov-like equation, but it seems hard for me to develop a simpler way to solve it. From the computation effort, I need some help for solving the special ...
Hellen's user avatar
  • 121
12 votes
2 answers
2k views

Factorization of a matrix as a product of a symmetric and a skew-symmetric matrix

When can an $n\times n$ matrix $M$ be written as a product $M=AB$, where $A^T=A$ and $B^T=-B$? For example, a necessary condition is that the trace of $M$ vanishes. In this case, it is easy to check ...
Cristi Stoica's user avatar
12 votes
2 answers
759 views

When Do a Few Eigenvectors of Graph Laplacians Not Determine the Graph?

Essentially as the title, but I'll give a little bit more background. I have some finite graph $G$ with $n$ vertices and adjacency matrix $A$. Let $D$ be the $n$ by $n$ matrix with the degree of ...
floc's user avatar
  • 193
12 votes
1 answer
3k views

invariant polynomials on 3 by 3 matrices

Hi there: A freshman level question here. A polynomial p on the entries of n by n matrices is said to be invariant if p(A)=p(sAs^{-1}) for every invertible matrix s. For example, for 3 by 3 matrices, ...
Ron Yang's user avatar
  • 141
12 votes
2 answers
1k views

Prove/disprove a linear algebra inequality

Setting: Suppose $\{u_i\}_{i=1}^n \subset R^d$ is a collection of unit vectors such that $u_i^Tu_j < 0$ for all $i\neq j$, and $w$ is a unit vector such that $u_i^T w> 0$ for all $i=1,\dotsc,n$. ...
Chen Zeno's user avatar
  • 115
12 votes
1 answer
1k views

Eigenvalues come in pairs

Consider the two matrices with some parameter $s \in \mathbb R$ $$A_1= \begin{pmatrix} s& -1 &0& 0 \\1&0 &0&0 \\ 0&0&1&0 \\0&0&0&1 \end{pmatrix}$$ and $$...
Pritam Bemis's user avatar
12 votes
2 answers
2k views

Determinant of identity matrix plus Hilbert matrix

I am looking for the determinant $$ \det(I_n + H_n) $$ where $I_n$ is the $n \times n$ identity matrix and $H_n$ is the $n \times n$ Hilbert matrix, whose entries are given by $$ [H_n]_{ij} = \frac{...
Tobi's user avatar
  • 121
12 votes
1 answer
231 views

History of publication of von Neumann's characterization of orthogonally invariant matrix norms

Von Neumann has a result (rather well-known in convex analysis circles) which states that every orthogonally invariant matrix norm (meaning $\| P M Q\| = \| M \|,$ for any orthogonal $P, Q$) is a ...
Igor Rivin's user avatar
  • 96.4k
12 votes
1 answer
290 views

Largest subset of $GL_n(p)$ in which pairwise subtraction is also in $GL_n(p)$

Suppose $X\subset \mathrm{GL}_n(p)$ is a set of invertible matrices such that for every $A,B\in X$ then also $A-B\in \mathrm{GL}_n(p)\cup \{0\}$. (If anyone knows a name for such sets I would be ...
A.B.'s user avatar
  • 407
12 votes
1 answer
3k views

Matrix inversion lemma with pseudoinverses

The utility of the Matrix Inversion Lemma has been well-exploited for several questions on MO. Thus, with some positive hope, I'd like to field a question of my own. Suppose we pick $n$ values $x_1,\...
Suvrit's user avatar
  • 28.6k
12 votes
4 answers
2k views

Symplectic equivalent of commuting matrices

It is well known what happens if two real symmetric matrices commute, i.e. if we have two matrices $A$ and $B$ such that $A=A^T$, $B=B^T$ and $AB=BA$. The answer is given in terms of diagonalization: ...
Doriano Brogioli's user avatar
12 votes
2 answers
883 views

Residues of $\frac{1}{\prod_{i=1}^n (x-P_i)^{e_i}}$

This is a problem occurring in my research about deformations of $\mathbb{Z}/p^n$-covers over a ring of power series. Given an algebraically closed field $k$ of characteristic $p>0$, suppose $1< ...
Huy Dang's user avatar
  • 245
12 votes
1 answer
1k views

Maximal Number of Pairs of Orthogonal vectors in a set of $n$ vectors in $\mathbb{R}^3$

Suppose you are given a set of $n$ non-zero vectors in $\mathbb{R}^3$. What is the maximum number of pairs of them that are orthogonal? The current guess is $\le 2n$. EDIT: I forgot to add that no ...
batconjurer's user avatar
12 votes
1 answer
2k views

Comparing Krein-Rutman theorem and Perron–Frobenius theorem

Krein–Rutman theorem is a generalization of Perron–Frobenius theorem, I know that things could be more subtle in infinite dimension, yet there's an important result in Perron–Frobenius that's missing ...
Sylvan's user avatar
  • 273
12 votes
2 answers
9k views

Is there a way to simplify block Cholesky decomposition if you already have decomposed the submatrices along the leading diagonal?

Let's say we have a block matrix $ M =\left( \begin{array}{ccc} A & B\\ B^{*} & C \end{array} \right)$ where $M$ is positive definite. ($A$ and $C$ are also positive definite.) There is a ...
12 votes
2 answers
4k views

How can one construct a sparse null space basis using recursive LU decomposition?

Given an $m$ by $n$ matrix $A$ I'm familiar with the standard method to compute a basis for the null space of $A$ by computing a QR factorization of $A^T$. If $A$ is large and sparse, we can use ...
Alec Jacobson's user avatar
12 votes
1 answer
1k views

Decomposition of positive definite matrices.

It is known that a $n^2 \times n^2$ positive semidefinite matrix $A$ cannot always be written as a finite sum $$ A=\sum_{j} B_j \otimes C_j $$ with $B_j$ and $C_j$ positive semidefinite matrices (of ...
Ruben A. Martinez-Avendano's user avatar
12 votes
3 answers
4k views

Status of Hadamard matrix conjecture

I would like to know if any progress has been made on Hadamard conjecture : Hadamard matrix of order $4k$ exists for every positive integer $k$.
Serifo  Blade's user avatar
12 votes
2 answers
1k views

Another $2 \times 2$ matrix question

This question is similar to this previous one but I think it is harder. Let $X$, $Y$, $Z$, and $W$ be $2\times 2$ Hermitian matrices. Can we always find $\theta,\phi \in [0,\pi/2]$ and $2\times 2$ ...
Nik Weaver's user avatar
  • 42.8k
12 votes
1 answer
750 views

Vanishing theorems in positive characteristic

In the paper Deligne, Pierre; Illusie, Luc (1987), "Relèvements modulo $p^{2}$ et décomposition du complexe de De Rham", Inventiones Mathematicae 89 (2): 247–270, doi:10.1007/BF01389078 I found the ...
Puzzled's user avatar
  • 8,998
12 votes
1 answer
2k views

Replacement for derivations in characteristic p?

Let $k$ be a field. If $f \in k[x]$ is a polynomial, and $d/dx\ f = 0$, then either $f$ is constant, or $char\ k = p$ and $f \in k[x^p]$. So "annihilated by all derivations" is perhaps not the right ...
Allen Knutson's user avatar
12 votes
2 answers
3k views

How to project a vector onto a very large, non-orthogonal subspace

I have a difficult problem. I have a very large, non-orthogonal matrix $A$ and need to project the vector $y$ onto the subspace spanning the columns of $A$. If this were a small matrix, I would use ...
rlbond's user avatar
  • 223
12 votes
3 answers
383 views

Probability of $\ell_1$-norms of vertices of the rotated Hamming cube

Let $O$ be a $d$-dimensional rotation matrix (i.e., it has real entries and $OO^T = O^TO = I$). Let $\mathbf{x}$ be a uniformly random bitstring of length $d$, i.e., $\mathbf{x} \sim U(\{0,1\}^d)$. In ...
arriopolis's user avatar
12 votes
2 answers
781 views

Determinant of a checkerboard Hankel matrix with Catalan numbers

My goal is to compute \begin{equation} I = \det \left(\mathbf{I} + \mathbf{A}\right) \end{equation} where $\mathbf{A}$ is a $n \times n$ checkerboard matrix filled with Catalan numbers: $$ \left\{ ...
user16215's user avatar
  • 840
12 votes
3 answers
1k views

Eigencircles of n x n matrices?

An eigenvalue of a 2 x 2 matrix satisfies the equation $$ \left(\begin{array}{cc} a & b \\ c & d \end{array} \right)\left( \begin{array}{c} x \\ y \end{array}\right) = \lambda \left( \...
john mangual's user avatar
  • 22.8k
12 votes
3 answers
607 views

Example of a form linear in infinitely many variables ?

We all know plenty of examples of multilinear forms in finitely many variables (e.g. determinants). However, I am missing an interesting example of a form in infinitely many variables, linear in each. ...
Matthieu Romagny's user avatar
12 votes
1 answer
624 views

Determinants: periodic entries $0,1,2,3$

Consider an $n\times n$ matrix $M_n$ where the sequence $$\{1,2,3,\dots,n^2\} \mod 4=\{1,2,3,0,1,2,3,\dots\}$$ forms a clock-wise spiral, in that given order. For example, $$M_4=\begin{bmatrix} 1&...
T. Amdeberhan's user avatar
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
12 votes
2 answers
830 views

Matrices into path algebras

I was thinking about quivers recently, and the following idea came to me. Let ei,j denote the matrix unit in Mn for 1 ≤ i,j ≤ n. Let Γ denote the complete quiver on vertices {1, …,...
Sammy Black's user avatar
  • 1,756
12 votes
2 answers
985 views

Common basis for permutation matrices

How can I check whether there exists a common basis with respect to which two matrices 𝐴 and 𝐵 are permutation matrices? More explicitly, let $A$ and $B$ be two unitary matrices whose eigenvalues ...
as2457's user avatar
  • 295
12 votes
1 answer
295 views

On Sampling rank $r$ matrices

Sample $n^2$ integers $a_{11},\dots,a_{nn}$ in $\{-d,\dots,-1,0,1\dots,d\}$ uniformly. What is the probability that the resulting matrix $[a_{ij}]$ has rank $r$? Is there a nice parametrization of ...
Turbo's user avatar
  • 13.9k
12 votes
1 answer
4k views

How to check whether a positive integer can be written as linear combination of given others, where all coefficients are positive?

Let $n$, $k$ and $m_1, \dots, m_k$ be positive integers. Which is the most efficient algorithm to find out whether there are positive integers $a_1, \dots, a_k$ such that $n = \sum_{i=1}^k a_i m_i$? ...
kyrpav's user avatar
  • 241

1
9 10
11
12 13
126