GitHub

🟢 DimerLattice/PartitionFunction/OBC

Provisional v2 view — RES not wired

Generated by docs/atlas/generate.jl — a pure VIEW over the *_registry.jl claims + the static test/INVENTORY.jsonl AST scan. No test is executed and no src is run; test/INVENTORY.jsonl is regenerated in-place (idempotently) from that static scan; fetch/@register untouched. Assurance labels are PROVISIONAL: residuals / confidence are not shown yet (RES not wired). Badges reflect the committed test AST, not the latest CI run — a hub can read green while its @test is red between regenerations. @sweep = a graceful regime-resolution gap, not card omission.

Assurance level: corroborated-at-p

Independently corroborated. See the cards below.

src claim

  • method analytic, status exact, reliability high, refs: Kasteleyn1961 | TemperleyFisher1961
  • Number of perfect matchings of the open Lx×Ly grid via the KTF product ∏(4cos²(jπ/(m+1))+4cos²(kπ/(n+1)))^{1/4}; 0 for odd Lx·Ly.

Corroboration

regimemechanismindependencerefsfile
@sweeped_finite_size🟢 structuralKasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumerationtest/models/classical/test_dimer_lattice.jl
@sweeped_finite_size🟢 structuralKasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumerationtest/models/classical/test_dimer_lattice.jl
@sweeped_finite_size🟢 structuralKasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumerationtest/models/classical/test_dimer_lattice.jl
@sweeped_finite_size🟢 structuralKasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumerationtest/models/classical/test_dimer_lattice.jl
@sweeped_finite_size🟢 structuralKasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumerationtest/models/classical/test_dimer_lattice.jl

Test calls

The exact verify(...) call the harness executed for this hub (reconstructed from the test AST):

verify(DimerLattice(; Lx = 2, Ly = 2), PartitionFunction(), OBC(); route = :ed_finite_size, fetch_kw = (; Lx = 2, Ly = 2), independent = Float64(_brute_dimer_count(2, 2)), agree_within = 1.0e-6, refs = ["Kasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumeration"])
verify(DimerLattice(; Lx = 4, Ly = 4), PartitionFunction(), OBC(); route = :ed_finite_size, fetch_kw = (; Lx = 4, Ly = 4), independent = Float64(_brute_dimer_count(4, 4)), agree_within = 1.0e-6, refs = ["Kasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumeration"])
verify(DimerLattice(; Lx = 6, Ly = 6), PartitionFunction(), OBC(); route = :ed_finite_size, fetch_kw = (; Lx = 6, Ly = 6), independent = Float64(_brute_dimer_count(6, 6)), agree_within = 1.0e-6, refs = ["Kasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumeration"])
verify(DimerLattice(; Lx = 2, Ly = 6), PartitionFunction(), OBC(); route = :ed_finite_size, fetch_kw = (; Lx = 2, Ly = 6), independent = Float64(_brute_dimer_count(2, 6)), agree_within = 1.0e-6, refs = ["Kasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumeration"])
verify(DimerLattice(; Lx = 4, Ly = 6), PartitionFunction(), OBC(); route = :ed_finite_size, fetch_kw = (; Lx = 4, Ly = 6), independent = Float64(_brute_dimer_count(4, 6)), agree_within = 1.0e-6, refs = ["Kasteleyn 1961: KTF Pfaffian count vs brute-force perfect-matching enumeration"])

Assurance (provisional)

  • level: corroborated-at-p 🟢
  • cards: 5 · model ED-feasible
  • RES not wired — measured residuals / confidence are not shown yet.

← Model: DimerLattice · Quantity: PartitionFunction · Atlas index