Constrained optimal rearrangement problem leading to a new type obstacle problem
Hayk Mikayelyan

TL;DR
This paper introduces a new obstacle problem derived from a constrained optimal rearrangement in cylindrical domains, establishing existence and regularity results, and highlighting unique properties like the failure of the comparison principle.
Contribution
It formulates a novel obstacle problem from a classical rearrangement problem with a non-standard constraint, providing foundational theoretical results and identifying open issues.
Findings
Existence and regularity of solutions are established.
Comparison principle does not hold for minimizers.
Identified open problem related to Theorem 4.2.
Abstract
We consider a new type of obstacle problem in the cylindrical domain arising from minimization of the functional where . We prove several existence and regularity results and show that the comparison principle does not hold for minimizers. This problem is derived from a classical optimal rearrangement problem in a cylindrical domain, under the constraint that the force function does not depend on the variable of the cylindrical axis. A mistake in the Theorem 4.2 of the previous version has been found. The statement remains an open problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNonlinear Partial Differential Equations
