Related papers: A Short Note on Kronecker Square Roots

In a previous paper, we derived necessary and sufficient conditions for the invertibility of square submatrices of the Pascal upper triangular matrix. To do so, we established a connection with the two-point Birkhoff interpolation problem.…

Let $k$ be a perfect field of characteristic $\neq 2$. We prove that the Schmidt rank (also known as strength) of a quartic polynomial $f$ over $k$ is bounded above in terms of only the Schmidt rank of $f$ over $\overline{k}$, an algebraic…

These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…

In this article the quantized matrix algebras as in the title have been studied at a root of unity. A full classification of simple modules over such quantized matrix algebras of rank $2$ along with a class of finite dimensional…

We have found a possibility to streamline the proof of the Treves' theorem (Duke Math. J., 108, 251-295, 2001) on an algebraic characterization of the KdV hierarchy which makes it significantly shorter, following essentially the logic of…

A few matrix-vector multiplications with random vectors are often sufficient to obtain reasonably good estimates for the norm of a general matrix or the trace of a symmetric positive semi-definite matrix. Several such probabilistic…

This article is devoted to the study of the centralizer and the clifforder of a matrix over a field $\mathbb{F}$ of characteristic zero, as well as the quasi-commutative relations between matrices over the complex field $\mathbb{C}$. We…

We study the rank weight hierarchy, thus in particular the rank metric, of cyclic codes over the finite field $\mathbb F_{q^m}$, $q$ a prime power, $m \geq 2$. We establish the rank weight hierarchy for $[n,n-1]$ cyclic codes and…

We analyze different approaches to differential-algebraic equations with attention to the implemented rank conditions of various matrix functions. These conditions are apparently very different and certain rank drops in some matrix…

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

In this paper we give a generalization created by the author of the theory of rook polynomials and permanents of circulants, Toeplits matrices and their submatrices.

Let k be a field of characteristic p>0, and G be a finite group. The first result of this paper is an explicit formula for the determinant of the Cartan matrix of the Mackey algebra mu_k(G) of G over k. The second one is a formula for the…

Models in which the covariance matrix has the structure of a sparse matrix plus a low rank perturbation are ubiquitous in data science applications. It is often desirable for algorithms to take advantage of such structures, avoiding costly…

We consider the problem of finding the best nonnegative rank-2 approximation of an arbitrary nonnegative matrix. We first revisit the theory, including an explicit parametrization of all possible nonnegative factorizations of a nonnegative…

Integer data sets frequently appear in many applications in sciences and technology. To analyze these, integer low rank approximation has received much attention due to its capacity of representing the results in integers preserving the…

Let $k$ be an algebraically closed field and $A$ the polynomial algebra in $r$ variables with coefficients in $k$. In case the characteristic of $k$ is $2$, Carlsson conjectured that for any $DG$-$A$-module $M$ of dimension $N$ as a free…

We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

In this paper, we have constructed the higher order k-bonacci matrices and studied some of their basic properties. We have also shown that these matrices satisfying some new and interesting relations in k-bonacci recurrence. This is the…

The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…