Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem

This paper presents a polynomial-time algorithm for optimal group selection within the algebraic diversity framework, reducing the combinatorial problem to a generalized eigenvalue problem. The method directly constructs the optimal group generator from the minimum eigenvector of the double-commutator matrix.