Algorithms for computing linear invariants if directed graphs

Jacob Towber

Call two pairs $(M,N)$ and $(M^{\prime },N^{\prime })$ of $m\times n$ matrices over a field $K$, \emph{simultaneously K-equivalent} if there exist square invertible matrices $S,T$ over K, with $M'=S…