Recovering a group from few orbits
Dustin G. Mixon, Brantley Vose

TL;DR
This paper establishes precise bounds on the number of generic orbits required to uniquely identify an unknown finite automorphism group of a finite-dimensional Hilbert space, both up to isomorphism and as a set of automorphisms.
Contribution
It provides the first sharp bounds on the minimal number of orbits needed for group recovery in this context.
Findings
Derived sharp bounds for group recovery from orbits
Quantified the number of orbits needed for isomorphism classification
Analyzed the set-based recovery of automorphism groups
Abstract
For an unknown finite group of automorphisms of a finite-dimensional Hilbert space, we find sharp bounds on the number of generic -orbits needed to recover up to group isomorphism, as well as the number needed to recover as a concrete set of automorphisms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Geometric and Algebraic Topology
