← All problems

Extremal critical-point conjecture for quadrature domains

7 years old · traced to

Let an RL-domain be a domain of order nn and connectivity kk whose landscape function is defined as in the paper. For integers n≥2n\geq 2 and 1≤k≤n+11\leq k\leq n+1, the conjecture is that there exists an RL-domain Ω\Omega of order nn and connectivity kk whose landscape function has exactly

4n+k−64n+k-6

critical points in Ω\Omega.

Extremal critical-point conjecture. For every n≥2n\geq 2, and for each k=1,2,…,n+1k=1,2,\ldots,n+1, such a domain exists. The bound is attained for k=n+1k=n+1 by the extremal construction described in the paper; existence for all connectivities is supported by computer simulations but remains unproved.

References
  1. 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.