Solving the two-dimensional CIS problem by a rational algorithm

@article{Alpin2000SolvingTT,
title={Solving the two-dimensional CIS problem by a rational algorithm},
author={Yurii A. Al'pin and A. George and K. Ikramov},
journal={Linear Algebra and its Applications},
year={2000},
volume={312},
pages={115-123}
}

Abstract The CIS problem is formulated as follows. Let p be a fixed integer, 1⩽p . For given n×n compex matrices A and B , can one verify whether A and B have a common invariant subspace of dimension p by a procedure employing a finite number of arithmetical operations? We describe an algorithm solving the CIS problem for p=2 . Unlike the algorithm proposed earlier by the second and third authors, the new algorithm does not impose any restrictions on A and B . Moreover, when A and B generate a… Expand