Related papers: Kronecker products and the RSK correspondence
The results of [I. Ojeda, Amer. Math. Monthly, 122, pp 60--64] provides a characterization of Kronecker square roots of matrices in terms of the symmetry and rank of the block vec matrix (rearrangement matrix). In this short note we…
We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups S_n contain all irreducibles as their constituents. Our main result is that they contain representations…
The set of mxn singular matrix pencils with normal rank at most r is an algebraic set with r+1 irreducible components. These components are the closure of the orbits (under strict equivalence) of r+1 matrix pencils which are in Kronecker…
We describe a new algorithm that computes the minimal list of inequalities for the moment cone of any representation of a complex reductive group, with implementation details for two fundamental cases: the Kronecker cone (governing the…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world graphs (small-world, scale-free, heavy-tailed degree…
We prove a family of $n$-th order identities for quantum $R$-matrices of Baxter-Belavin type in fundamental representation. The set of identities includes the unitarity condition as the simplest one ($n=2$). Our study is inspired by the…
The properties and applications of kronecker product in quantum theory is studied thoroughly. The use of kronecker product in quantum information theory to get the exact spin Hamiltonian is given. The proof of non-commutativity of matrices,…
This paper is a subsequent paper of math.RT/0607673. Here we consider the irreducible components of Springer fibres (or orbital varieties) for two-column case in GL}_n. We describe the intersection of two irreducible components, and…
In this work, we revisit prefix sums through the lens of linear algebra. We describe an identity that decomposes triangular all-ones matrices as a sum of two Kronecker products, and apply it to design recursive prefix sum algorithms and…
By proving the minimality of face transformations acting on the diagonal points and searching the points allowed in the minimal sets, it is shown that the regionally proximal relation of order $d$, $\RP^{[d]}$, is an equivalence relation…
We study the Riemannian optimization methods on the embedded manifold of low rank matrices for the problem of matrix completion, which is about recovering a low rank matrix from its partial entries. Assume $m$ entries of an $n\times n$ rank…
Our main result is an elementary derivation of the spectral decomposition of hypermatrices generated by arbitrary combinations of Kronecker products and direct sums of cubic side length 2
We consider the problem of extracting a common structure from multiple tensor datasets. For this purpose, we propose multilinear common component analysis (MCCA) based on Kronecker products of mode-wise covariance matrices. MCCA constructs…
We exploit the versatile framework of Riemannian optimization on quotient manifolds to develop R3MC, a nonlinear conjugate-gradient method for low-rank matrix completion. The underlying search space of fixed-rank matrices is endowed with a…
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…
This paper provides a general solution for the Kronecker product decomposition (KPD) of vectors, matrices, and hypermatrices. First, an algorithm, namely, monic decomposition algorithm (MDA), is reviewed. It consists of a set of projections…
We study two new families of symmetric functions arising from a species-theoretic construction motivated by cycle structure. For each partition of $n$, we define two combinatorial species that decompose into molecules indexed by the same…
We introduce a probabilistic generalization of the dual Robinson--Schensted--Knuth correspondence, called $qt$RSK${}^*$, depending on two parameters $q$ and $t$. This correspondence extends the $q$RS$t$ correspondence, recently introduced…
A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given.…