ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N(x)N(x) be the Pearcey process counting function, let xkx_k denote its ordered points, and let ρ\rho be the parameter appearing in the deterministic asymptotics. For any ϵ>0\epsilon>0, the following two lower bounds hold:

Global rigidity lower-bound conjecture.

lim⁡s→∞P(sup⁡x>s∣N(x)−(334πx43−3ρ2πx23)log⁡x∣≥423π−ϵ)=1,\lim_{s\to\infty}\mathbb P\left(\sup_{x>s}\left|\frac{N(x)-\left(\frac{3\sqrt{3}}{4\pi}x^{\frac{4}{3}}-\frac{\sqrt{3}\rho}{2\pi}x^{\frac{2}{3}}\right)}{\log x}\right|\geq\frac{4\sqrt{2}}{3\pi}-\epsilon\right)=1, lim⁡k0→∞P(sup⁡k≥k0∣334πxk43−3ρ2πxk23−k∣log⁡k≥2π−ϵ)=1.\lim_{k_0\to\infty}\mathbb P\left(\sup_{k\geq k_0}\frac{\left|\frac{3\sqrt{3}}{4\pi}x_k^{\frac{4}{3}}-\frac{\sqrt{3}\rho}{2\pi}x_k^{\frac{2}{3}}-k\right|}{\log k}\geq\frac{\sqrt{2}}{\pi}-\epsilon\right)=1.

These conjectured bounds assert sharp logarithmic-scale fluctuations for both the counting function and the locations of the Pearcey process points, complementing the corresponding upper bounds. Their status is not resolved in the supplied source context.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.