Related papers: Decomposition results for Gram matrix determinants

We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…

Let K, K' be convex cones residing in finite-dimensional real vector spaces E, E'. An element in the tensor product E \otimes E' is K \otimes K'-separable if it can be represented as finite sum \sum_l x_l \otimes x'_l with x_l \in K and…

We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…

Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…

With $\{X_i\}$ independent $N \times N$ standard Gaussian random matrices, the probability $p_{N,N}^{P_m}$ that all eigenvalues are real for the matrix product $P_m = X_m X_{m-1} \cdots X_1$ is expressed in terms of an $N/2 \times N/2$ ($N$…

Given $A:=\left(\begin{smallmatrix}1&1\\0&1\end{smallmatrix}\right)$, $B:=\left(\begin{smallmatrix}1&0\\1&1\end{smallmatrix}\right)$ and $C:=\left(\begin{smallmatrix}1&0\\0&-1\end{smallmatrix}\right)$ three elements of…

For any real diagonalizable matrix with complex eigenvalues we provide a real, coordinate free decomposition with a clear geometric interpretation.

We study the decomposition matrices for the unipotent $\ell$-blocks of finite special unitary groups SU$_n(q)$ for unitary primes $\ell$ larger than $n$. Up to very few unknown entries, we give a complete solution for $n=2,\ldots,10$. We…

For every partition $\lambda$ of a positive integer $n$, let $S^{\lambda}$ be the corresponding Specht module of the symmetric group $\mathfrak{S}_n$, and let $\det(\lambda)\in \mathbb Z$ denote the Gram determinant of the canonical…

In a recent article, we gave a full characterization of matrices that can be decomposed as a linear combination of two idempotents with prescribed coefficients. In this one, we use those results to improve on a recent theorem of V.…

We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas…

We give an explicit decomposition of $\hbox{Ind}(1)_{B_n}^{S_{2n}}$, following Barbasch and Vogan [1]. We define two natural generalizations of $B_n$, and extend the proof in [1] to recursively compute these decompositions. Although the…

Decomposing a matrix into a weighted sum of Pauli strings is a common chore of the quantum computer scientist, whom is not easily discouraged by exponential scaling. But beware, a naive decomposition can be cubically more expensive than…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…

We explore a natural extension of braid arrangements in the context of determinantal arrangements. We show that these determinantal arrangements are free divisors. Additionally, we prove that free determinantal arrangements defined by the…

We decompose the $\hat{\mathfrak{sl}}(n)$-module $V(\Lambda_0) \otimes V(\Lambda_0)$ and give generating function identities for the outer multiplicities. In the process we discover some seemingly new partition identities in the cases…

Let $R$ be a (not necessarily commutative) ring whose additive group is finitely generated and let $U_n(R) \subset GL_n(R)$ be the group of upper-triangular unipotent matrices over $R$. We study how the homology groups of $U_n(R)$ vary with…

It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…