Circular-domain critical-point conjecture

A circular domain is a domain whose boundary components are circles. Let Ω\Omega be a kk-connected circular domain, let vv be its landscape function, and let NN be the number of critical points of vv.

Circular-domain critical-point conjecture. For k3k\geq 3,

N5(k2).N\leq 5(k-2).

The conjecture is motivated by the corresponding extremal behavior for RL-domains. The source gives no resolution of this bound.

Sources & referencesView supporting material

Primary source

Erik Lundberg and Koushik Ramachandran, “A note on the critical points of the localization landscape”, arXiv:1907.08376 (2021).

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.