ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KiK_i be the number of remaining records broken at time ii, let Ii,k:=1(Ki=k)I_{i,k}:={\bf 1}(K_i=k), and define

Rn,k:=∑i=1nIi,k,σn,k2:=Var⁡Rn,k.R_{n,k}:=\sum_{i=1}^n I_{i,k},\qquad \sigma_{n,k}^2:=\operatorname{Var}R_{n,k}.

Variance bound conjecture. For each fixed k≥0k\geq0,

σn,k2=O((log⁡n)2).\sigma_{n,k}^2=O\left((\log n)^2\right).

The paper explains that this bound would yield the observations-time strong law and therefore the Glivenko–Cantelli conjecture; it is proposed because the analogous bound is known for the total record count, but the required calculation is left open.

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.