TheoremDB

Problem packetWorkR623

R623claimStatus: supportedEvidence: SupportedReplay: source only

[#R623] The current coding interval is 333 through 381, with a gap below the design endpoint

claim. An explicit 333-plane code supplies the lower bound, while divisibility and extension results imply that the maximum is at most 378 unless it equals 381.

View evidenceOpen source ↗

1Summary

Heinlein, Kiermaier, Kurz, and Wassermann constructed an explicit 333-plane code, proving \[ A_2(7,4;3)\geq333. \] The line-packing bound gives \(A_2(7,4;3)\leq381\). The 2025 survey records a sharper alternative obtained from extendability and divisible-code results: \[ A_2(7,4;3)\leq378\quad\text{or}\quad A_2(7,4;3)=381. \] A code at the second endpoint is exactly a binary q-Fano plane. The known 333-plane construction therefore measures progress on a relaxation. An extension certificate would still be needed to turn it into a solution of the 381-block exact cover.

Supported evidence. Recorded scope: the maximum size A_2(7,4;3) of a binary 3-dimensional constant-dimension code in ambient dimension 7 with minimum subspace distance 4.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, Heinlein, Kiermaier, Kurz, and Wassermann, A subspace code of size 333 in the setting of a binary q-analog of the Fano plane, Theorem 2; Kurz 2025 survey, section 6, pages 76-79

3What was measured

Lower bound
333
Packing upper bound
381
Refined alternative
A_2(7,4;3) <= 378 or A_2(7,4;3) = 381
Design endpoint
381
Exact value known
no

4How it connects

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R623",
  "content_hash": null,
  "slug": "qafp-code-bound",
  "type": "claim",
  "title": "The current coding interval is 333 through 381, with a gap below the design endpoint",
  "summary": "An explicit 333-plane code supplies the lower bound, while divisibility and extension results imply that the maximum is at most 378 unless it equals 381.",
  "relevance": "For A binary q-analog of the Fano plane, record qafp-code-bound (“The current coding interval is 333 through 381, with a gap below the design endpoint”) records a bound, answer, status fact, or structural consequence. The record states: An explicit 333-plane code supplies the lower bound, while divisibility and extension results imply that the maximum is at most 378 unless it equals 381.",
  "relevance_source": "recorded",
  "body": "Heinlein, Kiermaier, Kurz, and Wassermann constructed an explicit 333-plane code, proving\n\\[\nA_2(7,4;3)\\geq333.\n\\]\nThe line-packing bound gives \\(A_2(7,4;3)\\leq381\\). The 2025 survey records a sharper alternative obtained from extendability and divisible-code results:\n\\[\nA_2(7,4;3)\\leq378\\quad\\text{or}\\quad A_2(7,4;3)=381.\n\\]\nA code at the second endpoint is exactly a binary q-Fano plane. The known 333-plane construction therefore measures progress on a relaxation. An extension certificate would still be needed to turn it into a solution of the 381-block exact cover.",
  "status": "supported",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "bounded",
    "statement": "the maximum size A_2(7,4;3) of a binary 3-dimensional constant-dimension code in ambient dimension 7 with minimum subspace distance 4",
    "bounds": {
      "field_order": {
        "min": 2,
        "max": 2
      },
      "ambient_dimension": {
        "min": 7,
        "max": 7
      },
      "subspace_dimension": {
        "min": 3,
        "max": 3
      }
    },
    "exhaustive": false
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.3934/amc.2019029",
      "locator": "Heinlein, Kiermaier, Kurz, and Wassermann, A subspace code of size 333 in the setting of a binary q-analog of the Fano plane, Theorem 2; Kurz 2025 survey, section 6, pages 76-79"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.3934/amc.2019029",
    "locator": "Heinlein, Kiermaier, Kurz, and Wassermann, A subspace code of size 333 in the setting of a binary q-analog of the Fano plane, Theorem 2; Kurz 2025 survey, section 6, pages 76-79"
  },
  "models": [],
  "relations": [
    {
      "slug": "R625",
      "title": "Existence of the binary q-Fano plane remains open",
      "object_type": "claim",
      "relation": "refines",
      "direction": "outgoing"
    },
    {
      "slug": "q-analog-fano-plane",
      "title": "q analog fano plane",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
q-analog-fano-plane
Locator
Heinlein, Kiermaier, Kurz, and Wassermann, A subspace code of size 333 in the setting of a binary q-analog of the Fano plane, Theorem 2; Kurz 2025 survey, section 6, pages 76-79
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-25
Public record
R623
Stable alias
qafp-code-bound
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.