ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an infinite network, and let F\mathfrak F be either the wired or free spanning forest of GG. A Borel set A⊆{0,1}E\mathscr A\subseteq \{0,1\}^E is update-stable if, for every oriented edge ee of GG, the updated forest U(F,e)U(\mathfrak F,e) belongs to A\mathscr A if and only if F\mathfrak F belongs to A\mathscr A almost surely.

Update-stable zero-one conjecture. For every update-stable Borel set A⊆{0,1}E\mathscr A\subseteq \{0,1\}^E, the probability that F\mathfrak F belongs to A\mathscr A is either zero or one.

A positive solution would yield an alternative proof that the number of excessive ends of the wired or free uniform spanning forest is nonrandom, and would also imply a positive solution to Question 15.7 of Benjamini, Lyons, Peres, and Schramm.

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.