Obstacle problems for the fractional $p$-Laplacian on fractal domains: well-posedness and asymptotics
Simone Creo, Salvatore Fragapane

TL;DR
This paper investigates obstacle problems involving the fractional p-Laplacian on fractal domains with Koch snowflake boundaries, establishing well-posedness, equivalent formulations, and asymptotic behaviors as domain complexity and p grow large.
Contribution
It introduces the first well-posedness results for obstacle problems on fractal domains with fractional operators and analyzes their asymptotic limits.
Findings
Well-posedness of obstacle problems on Koch snowflake domains.
Equivalent formulations of the obstacle problem.
Asymptotic behavior as domain complexity and p tend to infinity.
Abstract
We study obstacle problems for the regional fractional -Laplacian in a domain having as fractal boundary the Koch snowflake. We prove well-posedness results for the solution of the obstacle problem, as well as two equivalent formulations. Moreover, we study corresponding approximating obstacle problems in a sequence of domains having as boundary the -th pre-fractal approximation of the Koch snowflake, for . After proving the well-posedness of the approximating obstacle problems, we perform the asymptotic analysis for both and .
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 · Mathematical Dynamics and Fractals · Advanced Mathematical Modeling in Engineering
