Related papers: Decomposition results for Gram matrix determinants

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many…

In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…

A t by n random matrix A is formed by sampling n independent random column vectors, each containing t components. The random Gram matrix of size n, G_n, contains the dot products between all pairs of column vectors in the randomly generated…

We generalize the result of Gorini, Kossakowski, and Sudarshan [J. Math. Phys. 17:821, 1976] that every generator of a quantum-dynamical semigroup decomposes uniquely into a closed and a dissipative part, assuming the trace of both…

A binary tensor consists of $2^n$ entries arranged into hypercube format $2 \times 2 \times \cdots \times 2$. There are $n$ ways to flatten such a tensor into a matrix of size $2 \times 2^{n-1}$. For each flattening, $M$, we take the…

The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…

For any positive integer $n$, $\mathcal{A}_n$ is the class of all groups $G$ such that, for $0\leq i\leq n$, $H^i(\hat{G},A)\cong H^i(G,A)$ for every finite discrete $\hat{G}$-module $A$. We describe certain types of free products with…

The determinant of an $N \times N$ circulant matrix $M = {\rm CIRC}[x_0, x_1, ..., x_{N-1}$] can be expanded in the form det$ ~M= \sum C_{a_0 a_1 ...a_{N-1}} x_{a_0} x_{a_1}...x_{a_{N-1}}$. By using the generating function of a restricted,…

We propose a method for determining $\gamma$ using $B^\pm\to D K^\pm$ decays followed by a multibody $D$ decay, such as $D \to K_S \pi^-\pi^+$, $D \to K_S K^-K^+$ and $D \to K_S \pi^-\pi^+\pi^0$. The main advantages of the method is that it…

The matrix $S = [1+x_i y_j]_{i,j=1}^{n}, 0<x_1<\cdots<x_n,\, 0<y_1<\cdots<y_n$, has gained importance lately due to its role in powers preserving total nonnegativity. We give an explicit decomposition of $S$ in terms of elementary…

In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…

We introduce deformations of the space of (multi-diagonal) harmonic polynomials for any finite complex reflection group of the form W=G(m,p,n), and give supporting evidence that this space seems to always be isomorphic, as a graded…

A description of the endomorphisms of semidirect products of two groups as a group of $2\times 2$ matrices of maps is already known. Using this description, we have studied the concept of determinant for the endomorphisms of semidirect…

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$…

The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant D(n) of a square {+1, -1} matrix of given order n. Such a matrix with maximum determinant is called a saturated D-optimal design. We consider some cases…

This note presents some equalities in law for $Z_N:=\det(\Id-G)$, where $G$ is an element of a subgroup of the set of unitary matrices of size $N$, endowed with its unique probability Haar measure. Indeed, under some general conditions,…

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…