Remarks on the classification of a pair of commuting semilinear operators
arXiv:1110.4073 · doi:10.1016/j.laa.2011.11.029
Abstract
Gelfand and Ponomarev [Functional Anal. Appl. 3 (1969) 325-326] proved that the problem of classifying pairs of commuting linear operators contains the problem of classifying k-tuples of linear operators for any k. We prove an analogous statement for semilinear operators.
15 pages
References in corpus (5)
Cited by in corpus (6)
- Wildness for tensors
- Regularizing algorithm for mixed matrix pencils
- Representations of quivers and mixed graphs
- Wildness of the problems of classifying two-dimensional spaces of commuting linear operators and certain Lie algebras
- Cycles of linear and semilinear mappings
- Tame systems of linear and semilinear mappings