Mathematics > Probability
[Submitted on 3 Feb 2022]
Title:Non-uniqueness times for the maximizer of the KPZ fixed point
View PDFAbstract:Let $\mathfrak h_t$ be the KPZ fixed point started from any initial condition that guarantees $\mathfrak h_t$ has a maximum at every time $t$ almost surely. For any fixed $t$, almost surely $\max \mathfrak h_t$ is uniquely attained. However, there are exceptional times $t \in (0, \infty)$ when $\max \mathfrak h_t$ is achieved at multiple points. Let $\mathcal T_k \subset (0, \infty)$ denote the set of times when $\max \mathfrak h_t$ is achieved at exactly $k$ points. We show that almost surely $\mathcal T_2$ has Hausdorff dimension $2/3$ and is dense, $\mathcal T_3$ has Hausdorff dimension $1/3$ and is dense, $\mathcal T_4$ has Hausdorff dimension $0$, and there are no times when $\max \mathfrak h_t$ is achieved at $5$ or more points. This resolves two conjectures of Corwin, Hammond, Hegde, and Matetski.
Current browse context:
math.PR
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.