Preprint in the OpenAI Math release
Strict convexity and differentiability of the planar exponential first-passage limit shape
OpenAI
Abstract
We prove that the limit shape of undirected nearest-neighbor first-passage percolation on ℤ with independent exponential edge weights is strictly convex and has a C boundary. This resolves the strict convexity and differentiability conjectures for the planar exponential model. More generally, we prove differentiability of the time-constant norm for every Gamma edge-weight law with positive shape and rate.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.