Related papers: Subrepresentations of Kronecker representations
Using a representation theoretical approach we give an explicit numerical characterization in terms of Kronecker invariants of the subfactor relation between two preinjective (and dually preprojective) Kronecker modules, describing…
We present a new solution to the classification problem for the category of representations of a quiver of type $\widetilde{A}_{3}$. Our approach uses linear algebra techniques which lead us to a reduction that allows to use induction. As…
We solve the problem of characterizing the Kronecker structure of a matrix pencil obtained by a rank-one perturbation of another matrix pencil. The results hold over arbitrary fields.
A matrix completion problem is to recover the missing entries in a partially observed matrix. Most of the existing matrix completion methods assume a low rank structure of the underlying complete matrix. In this paper, we introduce an…
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…
We introduce the notion of filtered representations of quivers, which is related to usual quiver representations, but is a systematic generalization of conjugacy classes of $n\times n$ matrices to (block) upper triangular matrices up to…
The relationship between linear relations and matrix pencils is investigated. Given a linear relation, we introduce its Weyr characteristic. If the linear relation is the range (or the kernel) representation of a given matrix pencil, we…
Quiver representations arise naturally in many areas across mathematics. Here we describe an algorithm for calculating the vector space of sections, or compatible assignments of vectors to vertices, of any finite-dimensional representation…
We introduce a generalization of representations of quivers that contains also representations of posets, vectorspace problems and other matrix problems. Many examples, some of which are given in the paper, show that the language of marked…
In this work, we propose a method to efficiently find the regularization parameter for low-rank MMSE filters based on a Kronecker-product representation. We show that the regularization parameter is surprisingly linked to the problem of…
We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kronecker pencils"---and perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any…
Under the action of the general linear group with tensor structure, the ranks of matrices $A$ and $B$ forming an $m \times n$ pencil $A + \lambda B$ can change, but in a restricted manner. Specifically, with every pencil one can associate a…
The complete characterization of the Kronecker structure of a matrix pencil perturbed by another pencil of rank one is known, and it is stated in terms of very involved conditions. This paper is devoted to, loosing accuracy, better…
The change of the Kronecker structure of a matrix pencil perturbed by another pencil of rank one has been characterized in terms of the homogeneous invariant factors and the chains of column and row minimal indices of the initial and the…
The standard way of solving the polynomial eigenvalue problem associated with a matrix polynomial is to embed the matrix polynomial into a matrix pencil, transforming the problem into an equivalent generalized eigenvalue problem. Such…
The Kronecker coefficients are the structure constants for the restriction of irreducible representations of the general linear group $GL(n m)$ into irreducibles for the subgroup $GL(n)\times GL(m)$. In this work we study the…
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecreasing function of the inner product then the learned vector…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
We introduce the notion of a super-representation of a quiver. For super-representations of quivers over a field of characteristic zero, we describe the corresponding (super)algebras of polynomial semi-invariants and polynomial invariants.
The maximal subgroup of unipotent upper-triangular matrices of the finite general linear groups are a fundamental family of $p$-groups. Their representation theory is well-known to be wild, but there is a standard supercharacter theory,…