Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hölder estimate for a tug-of-war game with $1<p<2$ from Krylov-Safonov regularity theory

Published 21 Dec 2022 in math.AP | (2212.10807v1)

Abstract: We propose a new version of the tug-of-war game and a corresponding dynamic programming principle related to the $p$-Laplacian with $1<p<2$. For this version, the asymptotic H\"older continuity of solutions can be directly derived from recent Krylov-Safonov type regularity results in the singular case. Moreover, existence of a measurable solution can be obtained without using boundary corrections. We also establish a comparison principle.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.