Assume that you are explicitly given the representation matrices of a group.
How does one go about finding that common basis which will find the irreducible components of all of them simultaneously?
...

Consider a random process defined on $2^{\mathcal{X}}$, i.e. all subsets of a set $\mathcal{X}$.
It's well known that this process is determinantal if one can find a positive semidefinite matrix K, ...

I have the following question. Suppose $g_1$ and $g_2$ are two finite dimensional, nilpotent, stratified Lie algebras and $A:g_1\to g_2$ is a morphism of the graded Lie algebra. I wonder whether there ...

The following determinant arises in a combinatorial enumeration problem. I wonder if anyone has seen it before in any context or knows how to evaluate it. I tried computing it for small $n$ but didn't ...

Say $A$ is a $(n-1)\times (n-1)$ matrix and we augment it by a $n^{th}$ row and a column and get a $n \times n$ matrix $B$. Is there a nice way to relate $det(B)$ and $det(A)$ and the added row and ...

Given a projective flat morphism $p: X \rightarrow Y$ of integral noetherian schemes of relative dimension one.
For a coherent sheaf $F$ on $Y$ we can define a line bundle $det(F)$ on $Y$ and for a ...

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

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

Update: see below
Let $M$ be an $n\times n$ matrix that's constructed as follows. Construct the right-most column of $M$ as $[\alpha_1(x_1),\cdots,\alpha_n(x_n)]^T$ for some class of fixed functions ...

The problems of determining the maximum determinant of an $n \times n$ $(0,1)$-matrix and the spectral problem of determining exactly which other determinants can possibly occur are both reasonably ...

Let $M$ be a $m\times n$ matrix with entries in, say $\mathbb{C}$; assume $n\leq m$. Denote by $I\subseteq\{1,2,\ldots, n\}$ a subset of the columns of M. I am interested in positive results to the ...

Let $\lambda_0,\lambda_1,\lambda_2,\lambda_3,\ldots$ be a sequence of Young diagrams, such that each successive diagram is obtained from the prior by the addition of one box (don't forget that the row ...

First version: Let $A$ and $B$ be (complex) Hankel matrix. Is it true that $\det (A+B)\neq 0$ if $\det A=0$ and $\det B\neq0$? No.
Reformulating: For which $B$ is it true that $\det (A+B)\neq 0$ if ...

There is a matrix A where each entry is either 0 or 1. Each column has exactly a 1's and each row has at most b 1's. What's the upper bound of abs(|A|)?
The condition is stronger than the Hadamard's ...

Recently, I have seen a matrix inequality but don't know how to prove it. The inequality goes as follows.
For an arbitrary $n\times n$ diagonal matrix $\mathbf{D}$ and an arbitrary upper-triangular ...

In graph theory, we work with adjacency matrices which define the connections between the vertices. These matrices have various properties in themselves. For example, their trace can be calculated (it ...

Let $\mathcal{R}$ be a ring and let $v^0,\ldots,v^{k-1}\in\mathcal{R}^m$ with $m \geq k$. Suppose we wish to find $w\in Span(v^0,\ldots,v^{k-1})$ such that $k-1$ specified coordinates of $w$ vanish ...

I am trying to prove that a mapping has a unique fixed-point by showing that its Jacobian is a P-matrix. In this particular case the Jacobian can be decomposed as the sum of two matrices and I would ...