probability-statistics / Dimer model; conformal loop ensembles

The double-dimer CLE4 scaling-limit conjecture in the half-plane Temperleyan setting

Theorem 1.1: for two independent dimer coverings of the Temperleyan square lattice in the upper half-plane with the standard infinite-volume law, the loop collection F(Lδ)F(\mathcal L_\delta), mapped to the disk, is tight and converges in law as δ→0\delta\to0 to F(L)F(\mathcal L) with L\mathcal L nested CLE4CLE_4, matching every macroscopic loop as an unparametrized curve with all nesting generations. New inputs: a bound on disjoint traversals of a slab and control of signed crossing counts, from a column transfer matrix. Not shown: bounded or general simply connected domains, non-Temperleyan boundary conditions, or other lattices.

28Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

probability-statisticsSep 23, 2026Significance 28/100Registry: unreviewed

The double-dimer CLE4 scaling-limit conjecture in the half-plane Temperleyan setting

Prior state unknown→proved

Theorem 1.1: for two independent dimer coverings of the Temperleyan square lattice in the upper half-plane with the standard infinite-volume law, the loop collection F(Lδ)F(\mathcal L_\delta), mapped to the disk, is tight and converges in law as δ→0\delta\to0 to F(L)F(\mathcal L) with L\mathcal L nested CLE4CLE_4, matching every macroscopic loop as an unparametrized curve with all nesting generations. New inputs: a bound o…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: for two independent dimer coverings of the Temperleyan square lattice in the upper half-plane with the standard infinite-volume law, the loop collection F(Lδ)F(\mathcal L_\delta), mapped to the disk, is tight and converges in law as δ→0\delta\to0 to F(L)F(\mathcal L) with L\mathcal L nested CLE4CLE_4, matching every macroscopic loop as an unparametrized curve with all nesting generations. New inputs: a bound on disjoint traversals of a slab and control of signed crossing counts, from a column transfer matrix. Not shown: bounded or general simply connected domains, non-Temperleyan boundary conditions, or other lattices.

Theorem 1.1: for two independent dimer coverings of the Temperleyan square lattice in the upper half-plane with the standard infinite-volume law, the loop collection F(Lδ)F(\mathcal L_\delta), mapped to the disk, is tight and converges in law as δ→0\delta\to0 to F(L)F(\mathcal L) with L\mathcal L nested CLE4CLE_4, matching every macroscopic loop as an unparametrized curve with all nesting generations. New inputs: a bound on disjoint traversals of a slab and control of signed crossing counts, from a column transfer matrix. Not shown: bounded or general simply connected domains, non-Temperleyan boundary conditions, or other lattices.

Recorded attempts

Evidence graph

Connected research record

The double-dimer CLE4 scaling-limit conjecture in the half-plane Temperleyan setting — Mathematical Frontier Network