Canonical Forms for Matrix Tuples in Polynomial Time

Qiao, Y; Sun, X

Canonical Forms for Matrix Tuples in Polynomial Time

Qiao, Y

Sun, X

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, 00, pp. 780-789
Issue Date:: 2024-11-29

Closed Access

	Filename	Description	Size
	Canonical_Forms_for_Matrix_Tuples_in_Polynomial_Time.pdf	Published version	374.19 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Qiao, Y https://orcid.org/0000-0003-4334-1449
dc.contributor.author	Sun, X
dc.date	2024-10-27
dc.date.accessioned	2025-02-27T03:50:05Z
dc.date.available	2025-02-27T03:50:05Z
dc.date.issued	2024-11-29
dc.identifier.citation	2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, 00, pp. 780-789
dc.identifier.isbn	979-8-3315-1675-8
dc.identifier.issn	1523-8288
dc.identifier.uri	http://hdl.handle.net/10453/185389
dc.description.abstract	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 Index Terms canonical form matrix tuples tensors group isomorphism computer algebra
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)
dc.relation.ispartof	2024 IEEE 65th Annual Symposium on Foundations of Computer Science
dc.relation.isbasedon	10.1109/focs61266.2024.00054
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Canonical Forms for Matrix Tuples in Polynomial Time
dc.type	Conference Proceeding
utslib.citation.volume	00
utslib.location.activity	Chicago, IL, USA
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	University of Technology Sydney/UTS Groups
pubs.organisational-group	University of Technology Sydney/UTS Groups/Centre for Quantum Software and Information (QSI)
utslib.copyright.status	closed_access	*
dc.date.updated	2025-02-27T03:50:03Z
pubs.finish-date	2024-10-30
pubs.place-of-publication	Piscataway, USA
pubs.publication-status	Published
pubs.start-date	2024-10-27
pubs.volume	00
dc.location	Piscataway, USA

Abstract:

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 Index Terms canonical form matrix tuples tensors group isomorphism computer algebra

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/185389