The recursive formula for critical spheres over real configurations

Let ZmZ_m denote the variety of critical (n1)(n-1)-spheres associated with a generic configuration of mm points in Rn\mathbb R^n, and let EDdegree(Zm)EDdegree(Z_m) be its Euclidean distance degree. For m>n+1m>n+1, the recursive formula for real critical spheres states

EDdegree(Zm)=EDdegree(Zm1)+k=0m(m1k1)(1+(1)k2+l=0n(kl)k1)EDdegree(Z_m)=EDdegree(Z_{m-1})+\sum_{k=0}^{m}{m-1\choose k-1}\left(\frac{1+(-1)^k}{2}+\sum_{l=0}^{n}{k\choose l}-k-1\right)

and equivalently

EDdegree(Zm)=EDdegree(Zm1)+k=0m1(m1k)l=0n(k+1l)m2m2.EDdegree(Z_m)=EDdegree(Z_{m-1})+\sum_{k=0}^{m-1}{m-1\choose k}\sum_{l=0}^{n}{k+1\choose l}-m2^{m-2}.

The recurrence is presented as a conjecture after numerical computations for symmetric configurations. Whether it holds for all generic real configurations in the stated range remains open.

Sources & referencesView supporting material

Primary source

Oliver Gäfvert, “Computational complexity of learning algebraic varieties”, arXiv:1910.03305 (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.