𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Kronecker Problem and related problems of Linear Algebra

✍ Scribed by Alexander G. Zavadskij


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
459 KB
Volume
425
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


We consider some classification problems of Linear Algebra related closely to the classical Kronecker Problem on pairs of linear maps between two finite-dimensional vector spaces. As shown by Djoković and Sergeichuk, the Kronecker's solution is extended to the cases of pairs of semilinear maps and (more generally) pseudolinear bundles respectively. Our objective is to deal with the semilinear case of the Kronecker Problem, especially with its applications. It is given a new short solution both to this case and to its contragredient variant. The biquadratic matrix problem is investigated and reduced in the homogeneous case (in characteristic / = 2) to the semilinear Kronecker Problem. The integer matrix sequence n and -transformation of polynomials are introduced and studied to get a simplified canonical form of indecomposables for the mentioned homogeneous problem. Some applications to the representation theory of posets with additional structures are presented.


πŸ“œ SIMILAR VOLUMES


An endomorphism algebra realization prob
✍ Daniel Simson πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 120 KB

Let R be a ΓΏnite-dimensional algebra over an algebraically closed ΓΏeld K. One of the main aims of this paper is to prove that if the algebra R is loop-ΓΏnite or R is strongly simply connected then the following three conditions are equivalent: (a) the algebra R is of inΓΏnite representation type, (b)

The Computational Complexity of Some Pro
✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

On the species and related problems
✍ Yannis G. Yatracos πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 266 KB