Generic injectivity of recovery from coprime power sums

From papers

Let nn and mm be positive integers, let a1,,ama_1,\ldots,a_m be powers with m=n+1m=n+1 and gcd(a1,,am)=1\gcd(a_1,\ldots,a_m)=1, and define

ϕ(z1,,zn)=(i=1nzia1,,i=1nziam).\phi(z_1,\ldots,z_n)=\left(\sum_{i=1}^n z_i^{a_1},\ldots,\sum_{i=1}^n z_i^{a_m}\right).

Generic-injectivity conjecture. The recovery of a set of nn complex numbers from n+1n+1 power sums with coprime powers is unique: for generic zCnz\in\mathbb{C}^n, the fiber ϕ1(ϕ(z))\phi^{-1}(\phi(z)) consists exactly of the n!n! coordinate permutations of zz. This means that ϕ\phi is generically injective modulo coordinate permutations. This would establish unique recovery from n+1n+1 power sums in the coprime case; the source gives no resolution beyond stating the conjecture.

Progress summary

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

Sources & referencesView supporting material

Primary source

Hana Melánová, Bernd Sturmfels and Rosa Winter, “Recovery from Power Sums”, arXiv:2106.13981 (2021).

Solutions 0

No solutions have been posted yet.