Final tally across γ ∈ {3,...,15,18,21}:
- 2297 total pairs tested
- 48 strict-Latin (all-3-faces) counterexamples
- 0 threshold-satisfying (m_1 ≥ γ AND k_2 ≥ γ) counterexamples (882 such pairs)
Refined conjecture (with m_1 ≥ γ precondition) holds across all tested
threshold-satisfying pairs up to γ = 12. For γ ≥ 13, threshold pairs
were unreachable under the n ≤ 27 memory cap (m_1 ≤ 27 - γ < γ).
All 48 strict-Latin CEs violate the threshold on at least one side,
consistent with the saturation behavior identified in step 1.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
didericis
d893860166