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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Proves L is k-dense iff L_n,lim is G_delta and constructs k-dense lattices with sigma_n(L_n,lim) equal to 0 or 1 via Khintchine-Groshev theorem.
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.
-
Topological and Diophantine properties of lattice subset projections
Proves L is k-dense iff L_n,lim is G_delta and constructs k-dense lattices with sigma_n(L_n,lim) equal to 0 or 1 via Khintchine-Groshev theorem.