Papers › Testing isomorphism between tuples of subspaces
Testing isomorphism between tuples of subspaces
Emily J. King, Dustin G. Mixon, Shayne Waldron
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary group or general linear group. If isomorphism also allows permutations of the subspaces, then the problem is at least as hard as graph isomorphism. Otherwise, we provide a variety of polynomial-time algorithms with Matlab implementations to test for isomorphism. Keywords: subspace isomorphism, Grassmannian, Bargmann invariants, H^∗-algebras, quivers, graph isomorphism
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections