Saved in:
Bibliographic Details
Main Authors: Qiao, Youming, Sun, Xiaorui
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.12457
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916400872816640
author Qiao, Youming
Sun, Xiaorui
author_facet Qiao, Youming
Sun, Xiaorui
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2409_12457
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Canonical forms for matrix tuples in polynomial time
Qiao, Youming
Sun, Xiaorui
Data Structures and Algorithms
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.
title Canonical forms for matrix tuples in polynomial time
topic Data Structures and Algorithms
url https://arxiv.org/abs/2409.12457