ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix P1,P2,…,PLP_1, P_2, \dots, P_L partitions of the unit square into 2 pieces. Compute

lim⁡n→∞Pn(Pk):=τn(Pk)∑ℓ=1Lτn(Pk).\lim_{n \to \infty} \mathbb{P}_n(P_k):= \frac{\tau_n(P_k)}{\sum_{\ell = 1}^L \tau_n(P_k)}.

where τn(P)\tau_n(P) is the number of tree-weighted partitions of the n×nn \times n grid graph that look like PP. This fraction is set up so that the leading terms cancel, so this is really picking out the second order terms, which should be something just related to the total boundary length.

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.