Pith. sign in

REVIEW 1 cited by

A gradient estimate for nonlocal minimal graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.08232 v4 pith:YOZT6NLF submitted 2017-11-22 math.AP math.DG

classification math.APmath.DG
keywords minimalnonlocalgradientballestimatefractionalboundestablish
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We consider the class of measurable functions defined in all of $\mathbb{R}^n$ that give rise to a nonlocal minimal graph over a ball of $\mathbb{R}^n$. We establish that the gradient of any such function is bounded in the interior of the ball by a power of its oscillation. This estimate, together with previously known results, leads to the $C^\infty$ regularity of the function in the ball. While the smoothness of nonlocal minimal graphs was known for $n = 1, 2$ (but without a quantitative bound), in higher dimensions only their continuity had been established. To prove the gradient bound, we show that the normal to a nonlocal minimal graph is a supersolution of a truncated fractional Jacobi operator, for which we prove a weak Harnack inequality. To this end, we establish a new universal fractional Sobolev inequality on nonlocal minimal surfaces. Our estimate provides an extension to the fractional setting of the celebrated gradient bounds of Finn and of Bombieri, De Giorgi & Miranda for solutions of the classical mean curvature equation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments

    cs.LG 2025-06 conditional novelty 4.0 of 10

    A DQN augmented with a contextual bandit that selects action durations is reported to outperform fixed and discrete action-repeat baselines on five Atari games.

Pith tools