Canonical forms for matrix tuples in polynomial time
<|reference_start|>Canonical forms for matrix tuples in polynomial time: Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we present polynomial-time algorithms for computing canonical forms of matrix tuples over a finite field under these actions. Our algorithm builds upon new structural insights for matrix tuples, which can be viewed as a generalization of Schur's lemma for irreducible representations to general representations.<|reference_end|>
@article{qiao2024canonical,
    title={Canonical forms for matrix tuples in polynomial time},
    author={Youming Qiao, Xiaorui Sun},
    journal={arXiv preprint arXiv:2409.12457},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.12457},
    primaryClass={cs.DS}
}