Related papers: Partial determinants of Kronecker products
Using the block vec matrix, I give a necessary and sufficient condition for factorization of a matrix into the Kronecker product of two other matrices. As a consequence, I obtain an elementary algorithmic procedure to decide whether a…
We compute the determinant of $\sum_{n=1}^{N} \vec{A}^{(n)} \otimes \vec{B}^{(n)}$, where $\vec{A}^{(n)}$ is square and ${\vec{B}^{(n)}=\vec{x}^{(n)}{\vec{y}^{(n)}}^T}$ where $\vec{x}^{(n)}$ and $\vec{y}^{(n)}$ have length $N$.
This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…
Let $A$ be a positive semidefinite $m\times m$ block matrix with each block $n$-square, then the following determinantal inequality for partial traces holds \[ (\mathrm{tr} A)^{mn} - \det(\mathrm{tr}_2 A)^n \ge \bigl| \det A -…
Given three lists of ideals of a Dedekind domain, the question is raised, whether there exist two matrices A and B with entries in the given Dedekind domain, such that the given lists of ideals are the determinantal divisors of A, B, and…
The asymptotic performance of a polar code under successive cancellation decoding is determined by the exponent of its polarizing matrix. We first prove that the partial distances of a polarizing matrix constructed from the Kronecker…
In this paper we consider four basic multidimensional matrix operations (outer product, Kronecker product, contraction, and projection) and two derivative operations (dot and circle products). We start with the interrelations between these…
Let $M$ be an $mn\times mn$ matrix over a commutative ring $R$. Divide $M$ into $m \times m$ blocks. Assume that the blocks commute pairwise. Consider the following two procedures: (1) Evaluate the $n \times n$ determinant formula at these…
Let $\mathbb{F}_q$ be an arbitrary finite field of order $q$. In this article, we study $\det S$ for certain types of subsets $S$ in the ring $M_2(\mathbb F_q)$ of $2\times 2$ matrices with entries in $\mathbb F_q$. For $i\in \mathbb{F}_q$,…
We introduce two equations expressing the inverse determinant of a full rank matrix $\mathbf{A} \in \mathbb{R}^{n \times n}$ in terms of expectations over matrix-vector products. The first relationship is $|\mathrm{det} (\mathbf{A})|^{-1} =…
We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…
Determinantal Point Processes (DPPs) are probabilistic models over all subsets a ground set of $N$ items. They have recently gained prominence in several applications that rely on "diverse" subsets. However, their applicability to large…
Given two $\left( n+1\right) \times\left( n+1\right)$-matrices $A$ and $B$ over a commutative ring, and some $k\in\left\{ 0,1,\ldots,n\right\}$, we consider the $\dbinom{n}{k}\times\dbinom{n}{k}$-matrix $W$ whose entries are $\left(…
The aim of this paper is to study linear preservers of the trace of Kronecker sums and their connection with preservers of determinants of Kronecker products. The partial trace and partial determinant play a fundamental role in…
We review the properties of the Kronecker (direct, or tensor) product of square matrices $A \otimes B \otimes C \cdots$ in terms of Hubbard operators. In its simplest form, a Hubbard operator $X_n^{i,j}$ can be expressed as the $n$-square…
The well-known formula $det(A\cdot B)=\det A \cdot \det B$ can be easily proved for finite dimensional matrices but it may be incorrect for the functional determinants of differential operators, including the ones which are relevant for…
Over the real numbers, the Kronecker sum is the unique operation on matrices which exponentiates to the Kronecker product. Kronecker quotients provide an algebraic view of decompositions of matrices in terms of Kronecker products. This…
A necessary and sufficient condition is derived for the controllability of Kronecker product networks, where the factor networks are general directed graphs. The condition explicitly illustrates how the controllability of the factor…
Kronecker's Theorem and Rabin's Theorem are fundamental results about computable fields F and the decidability of the set of irreducible polynomials over F. We adapt these theorems to the setting of differential fields K, with constrained…
We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…