First poly-time algorithm for dihedral and projected MRA via recursive method of moments on the third moment tensor, conditional on a verifiable rank conjecture for power-of-two lengths.
Improving the threshold for finding rank-1 matrices in a subspace
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
For generically generated moment matrices with O(n^d) atoms, the minimal face of the pseudo-moment cone is simplicial, enabling an efficient Carathéodory-type atomic decomposition algorithm.
citing papers explorer
-
Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment
First poly-time algorithm for dihedral and projected MRA via recursive method of moments on the third moment tensor, conditional on a verifiable rank conjecture for power-of-two lengths.
-
Simplicial Regularizability of the Pseudo-Moment Cone and Carath\'eodory-Type Atomic Decomposition of Moment Matrices
For generically generated moment matrices with O(n^d) atoms, the minimal face of the pseudo-moment cone is simplicial, enabling an efficient Carathéodory-type atomic decomposition algorithm.