Computing minimal generators of integer matrix sequences (abstract only)

Abstract

We describe a fraction free matrix Berlekamp/Massey algorithm. The algorithm behaves like a scalar algorithm by performing block eliminations through multiplication by adjoint matrices. The adjoints are computed using fraction free diagonalization. We also describe an interesting classification of the unique minimal generators of a linearly generated scalar integer sequence. A counter example to the scalar theorem is given for linearly generated integer matrix sequences.