ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Start with a unit square and repeatedly choose a current square uniformly and subdivide it into four squares. Let DnD_n be the minimum number of current squares in a connected set joining the bottom-left corner to the top-right corner after nn subdivisions. Does there exist a deterministic scaling function ana_n such that Dn/anD_n/a_n converges to a nondegenerate random variable? Does a shortest crossing stabilize under further subdivisions?

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.