Generic uniqueness conjecture for sparse periodic phase retrieval

Let NN be even, let KK be the sparsity, and let xx be a KK-sparse generic signal whose periodic auto-correlation is axa_x. An intrinsic symmetry is an element of the group DD of intrinsic symmetries, consisting of the symmetries that preserve the periodic auto-correlation. The generic uniqueness conjecture. If Ke0K e 0, Ke1K e 1, KeN1K e N-1, and KeNK e N, and if K or NKK\text{ or }N-K is at least 33, then, under the stated support condition that axa_x has more than KK non-zero entries, ax=axa_x=a_{x'} \implies that xx' is obtained from xx through an intrinsic symmetry. Equivalently, the periodic auto-correlation mapping is injective, up to intrinsic symmetries, for almost all signals. This is presented as the main conjecture of the paper; the source gives no resolution, so its status remains open.

Sources & referencesView supporting material

Primary source

Tamir Bendory and Dan Edidin, “Toward a mathematical theory of the crystallographic phase retrieval problem”, arXiv:2002.10081 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.