If m > n, the O(n)-orbit of a generic m-point binary signal with at least some equal magnitudes is uniquely recoverable from autocorrelation, with an O(m^8) algorithm in R^3 when one magnitude is distinct.
Orbit recovery for spherical functions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
bispectrum library delivers selective G-bispectra for seven groups with reduced costs (O(|G|) for finite groups, O(L^2) for spheres), sub-millisecond GPU times, and superior benchmark performance versus standard pooling in low-data regimes.
citing papers explorer
-
Euclidean distance geometry and the orthogonal beltway problem
If m > n, the O(n)-orbit of a generic m-point binary signal with at least some equal magnitudes is uniquely recoverable from autocorrelation, with an O(m^8) algorithm in R^3 when one magnitude is distinct.
-
bispectrum: Selective $G$-Bispectra Made Practical
bispectrum library delivers selective G-bispectra for seven groups with reduced costs (O(|G|) for finite groups, O(L^2) for spheres), sub-millisecond GPU times, and superior benchmark performance versus standard pooling in low-data regimes.