ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Hm,n\mathcal H_{m,n} denote the variety associated with critical (n−1)(n-1)-spheres for a generic configuration of mm points in Cn\mathbb C^n. Here EDdegree(Hm,n)EDdegree(\mathcal H_{m,n}) denotes its Euclidean distance degree. For m>n+2m>n+2, the recursive formula for critical spheres states that the number of critical spheres is

EDdegree(Hm,n)=EDdegree(Hm−1,n)+∑k=0m−1(m−1k)∑l=0n(k+1l)−2m−1−m2m−2.EDdegree(\mathcal H_{m,n})=EDdegree(\mathcal H_{m-1,n})+\sum_{k=0}^{m-1}{m-1\choose k}\sum_{l=0}^{n}{k+1\choose l}-2^{m-1}-m2^{m-2}.

The formula is proposed on the basis of numerical experiments and extends the explicitly proved case n=1n=1, where the Euclidean distance degree is 2m−1−12^{m-1}-1. Its validity for general n≥1n\geq 1 remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.