Skip to content

Erdős Problem #1165

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: solved (not automatically the live result).
Subject areas: probability.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Erdős Problem #1165. At time n, which sites has a planar random walk visited the most often, and how many ties persist infinitely often?

\[ F(n)=\{x\in\mathbb Z^2:f_n(x)=\max_y f_n(y)\},\quad\mathbb P(|F(n)|=r\ \mathrm{i.o.}). \]

For planar random walk S_k, local time f_n(x)=number of k in [0,n] such that S_k=x and FAVORITE SET F(n)={x:f_n(x)=max_y f_n(y)}. For integer r≥3 ask P(|F(n)|=r infinitely often). Cardinality of current tie set, not the union over past times. A self-avoiding 7-site walk at time6 can have seven simultaneous favorites: consistent with an EVENTUAL almost-sure ≤3 result.

A small example

Exhaustively 4^6=4096 walks of length6 from origin: histogram |F(6)|=1 for2036 paths, 2 for1124, 3 for156, 7 for780. The 7-favorite paths are self-avoiding. These finite laws do not establish an event infinitely often.

What is known

https://www.erdosproblems.com/1165 SOLVED, [Va99,6.77]. Tóth [To01] proves P(|F(n)|=r infinitely often)=0 for r≥4; Hao–Li–Okada–Zheng [HLOZ24] 2024 proves probability 1 for r=3. Taking countable union over all integer r≥4 yields eventually no ≥4 favorites a.s. Original proofs pending review.

GCL's current state

Authenticated source-bound original-issue audit reports the mathematical status, external source attribution and independently tested bounded evidence. The deterministic programme is ci/erdos_compendium_007_phase19_checks.py.

This source return is PARTIAL. Neither an original-source proof review, Lean kernel certification, independent critical approval nor protected V2 admission has been completed.

What remains

ERDOS-1165-FAVORITES-001: primary source Tóth01/HLOZ24, distinguish exactly r vs ≥r infinitely often and walk/local-time indexing, extend exact enumeration to n7/8 with independent reference algorithm, avoid finite-to-a.s. inference.

General probability theorems externally SOLVED, original proof not independently reviewed.

Sources and claim boundaries

https://www.erdosproblems.com/1165 ; [To01],[HLOZ24]; finite 4096-path enumeration.

Unaccepted editorial manuscript. The exact finite examples are independently checked; all general published claims await primary source fidelity review. A source-notation conflict is not a new theorem.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2436 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction