Regularity of critical polygons for the weighted Cheeger functional

Let J\mathcal{J} be the functional on the class Pn\mathcal{P}_n of simple polygons used in the paper. A polygon is a critical point of J\mathcal{J} when the limit in the paper's steepest-descent condition is zero for every sufficiently small perturbation, and for n{3,4}n\in\{3,4\} the critical points in Pn\mathcal{P}_n are the regular nn-gons inscribed in the circle of radius RnR_n^* centered at the origin. Critical polygon conjecture. The result stated above holds for all n3n\geq 3. The proposition is established for triangles and quadrilaterals in the radial-weight setting; the conjecture extends the coincidence between critical points and global maximizers to every number of polygon vertices.

Sources & referencesView supporting material

Primary source

Yohann de Castro, Vincent Duval and Romain Petit, “Towards Off-the-grid Algorithms for Total Variation Regularized Inverse Problems”, arXiv:2104.06706 (2022).

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.