Related papers: Partial determinants of Kronecker products

We present and prove closed form expressions for some families of binomial determinants with signed Kronecker deltas that are located along an arbitrary diagonal in the corresponding matrix. They count cyclically symmetric rhombus tilings…

We propose a test for testing the Kronecker product structure of a factor loading matrix implied by a tensor factor model with Tucker decomposition in the common component. Through defining a Kronecker product structure set, we define if a…

Consider rectangular matrices over a commutative ring R. Assume the ideal of maximal minors factorizes, I_m(A)=J_1*J_2. When is A left-right equivalent to a block-diagonal matrix? (When does the module/sheaf Coker(A) decompose as the…

Using $\mathcal{P}$-canonical forms of matrices, we derive the minimal polynomial of the Kronecker product of a given family of matrices in terms of the minimal polynomials of these matrices. This, allows us to prove that the product…

A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…

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…

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…

A unimodular $2\times 2$ matrix $A$ with entries in a commutative ring $R$ is called weakly determinant liftable if there exists a matrix $B$ congruent to $A$ modulo $R\det(A)$ and $\det(B)=0$; if we can choose $B$ to be unimodular, then…

We show that the well known Kronecker product is a suitable tool for the construction of matrix representations of widely used spin Hamiltonians. In this way we avoid the explicit use of basis sets for the construction of the matrix…

The pseudo-determinant Det(A) of a square matrix A is defined as the product of the nonzero eigenvalues of A. It is a basis-independent number which is up to a sign the first nonzero entry of the characteristic polynomial of A. We prove…

Let $A$, $B$ be multidimensional matrices of boundary format respectively $\prod_{i=0}^p(k_i+1)$, $\prod_{j=0}^q(l_j+1)$. Assume that $k_p=l_0$ so that the convolution $A\ast B$ is defined. We prove that $Det (A\ast B)=Det(A)^{\alpha}\cdot…

The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that need to be changed in order to obtain a matrix of rank at most $r$. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit…

We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…

In this paper, we study certain determinants over finite fields. Let $\mathbb{F}_q$ be the finite field of $q$ elements and let $a_1,a_2,\cdots,a_{q-1}$ be all nonzero elements of $\mathbb{F}_q$. Let…

Matrix pencils, or pairs of matrices, are used in a variety of applications. By the Kronecker decomposition Theorem, they admit a normal form. This normal form consists of four parts, one part based on the Jordan canonical form, one part…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…

We determine the Poincar\'e polynomial of the determinantal variety $\{\det = 0\}$ in the projective space associated with the monoid of $n\times n$ matrices.

We consider the numerical approximation of $f({\cal A})b$ where $b\in{\mathbb R}^{N}$ and $\cal A$ is the sum of Kronecker products, that is ${\cal A}=M_2 \otimes I + I \otimes M_1\in{\mathbb R}^{N\times N}$. Here $f$ is a regular function…