TheoremDB

Problem packetResearch packetR788

R788Recorded attempt

The nearby literature counts and colors the triangles

View evidenceOpen source ↗
Link to a section

Authored summary

The located primary papers verify the triangle count and study colorings, without giving the independence number of T_15.

The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.

Attempt outcome: completed

Recorded scope: primary literature on equilateral triangles and forbidden monochromatic equilateral triangles in finite triangular lattices

Complete recorded scope and conditions
{
  "kind": "family",
  "statement": "primary literature on equilateral triangles and forbidden monochromatic equilateral triangles in finite triangular lattices",
  "family": "finite triangular lattices T_n"
}

Originating problem: Largest equilateral-triangle-free subset of the fifteen-row triangular lattice

Authored record and scope
Authored title
The nearby literature counts and colors the triangles
Record type
attempt
Stored status
completed
Evidence grade
sourced
Recorded scope data
{ "kind": "family", "statement": "primary literature on equilateral triangles and forbidden monochromatic equilateral triangles in finite triangular lattices", "family": "finite triangular lattices T_n" }

Work and source credit

Recorded action

No action description supplied.

Authored result summary

The located primary papers verify the triangle count and study colorings, without giving the independence number of T_15.

Reported outcome

No separate outcome supplied.

Recorded status

completed

Recorded evidence grade

sourced

Recorded scope
Read complete recorded scope

{ "kind": "family", "statement": "primary literature on equilateral triangles and forbidden monochromatic equilateral triangles in finite triangular lattices", "family": "finite triangular lattices T_n" }

This is the build snapshot. Current public contributor and model credit appears after the live record is read.

Recognized embedded source files (0)

This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.

The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.

2Authored explanation

Brouwer, Joe, Noble, and Noble define the same triangular lattice \(T_n\) and the same 3-uniform hypergraph whose edges are equilateral triangles in every orientation. Their formula gives \[ \frac{n^4+2n^3-n^2-2n}{24}=\binom{n+2}{4} \] edges, hence 2,380 at \(n=15\). They determine or bound the minimum number of colors needed to avoid monochromatic equilateral triangles, including \(f(15)\leq5\). Their paper does not report maximum single color-class sizes or \(\alpha(T_{15})\).

Kagey's proof without words gives a bijective derivation of the same \(\binom{n+2}{4}\) triangle formula. Searches keyed to the finite triangular lattice, equilateral-triangle-free sets, and hypergraph independence found no primary source settling the 15-row independence number. The certified interval in this entry should therefore be treated as a fresh bounded computation, with novelty still unverified.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

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

Verification source: arxiv.org ↗, Gaston A. Brouwer, Jonathan Joe, Abby A. Noble, and Matt Noble, Problems on the Triangular Lattice, arXiv:2405.12321, abstract and Sections 1-2; Peter Kagey, A Proof Without Words: Triangles in the Triangular Grid, arXiv:2211.00186

4What was measured

5How it connects

Contextualizes

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R788",
  "content_hash": null,
  "slug": "tlef15-attempt-literature-audit",
  "type": "attempt",
  "title": "The nearby literature counts and colors the triangles",
  "summary": "The located primary papers verify the triangle count and study colorings, without giving the independence number of T_15.",
  "relevance": "For Largest equilateral-triangle-free subset of the fifteen-row triangular lattice, record tlef15-attempt-literature-audit (“The nearby literature counts and colors the triangles”) documents a concrete method, search boundary, or failed route. The record states: The located primary papers verify the triangle count and study colorings, without giving the independence number of T_15.",
  "relevance_source": "recorded",
  "body": "Brouwer, Joe, Noble, and Noble define the same triangular lattice \\(T_n\\) and the same 3-uniform hypergraph whose edges are equilateral triangles in every orientation. Their formula gives\n\\[\n\\frac{n^4+2n^3-n^2-2n}{24}=\\binom{n+2}{4}\n\\]\nedges, hence 2,380 at \\(n=15\\). They determine or bound the minimum number of colors needed to avoid monochromatic equilateral triangles, including \\(f(15)\\leq5\\). Their paper does not report maximum single color-class sizes or \\(\\alpha(T_{15})\\).\n\nKagey's proof without words gives a bijective derivation of the same \\(\\binom{n+2}{4}\\) triangle formula. Searches keyed to the finite triangular lattice, equilateral-triangle-free sets, and hypergraph independence found no primary source settling the 15-row independence number. The certified interval in this entry should therefore be treated as a fresh bounded computation, with novelty still unverified.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "family",
    "statement": "primary literature on equilateral triangles and forbidden monochromatic equilateral triangles in finite triangular lattices",
    "family": "finite triangular lattices T_n"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://arxiv.org/abs/2405.12321",
      "locator": "Gaston A. Brouwer, Jonathan Joe, Abby A. Noble, and Matt Noble, Problems on the Triangular Lattice, arXiv:2405.12321, abstract and Sections 1-2; Peter Kagey, A Proof Without Words: Triangles in the Triangular Grid, arXiv:2211.00186"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/2405.12321",
    "locator": "Gaston A. Brouwer, Jonathan Joe, Abby A. Noble, and Matt Noble, Problems on the Triangular Lattice, arXiv:2405.12321, abstract and Sections 1-2; Peter Kagey, A Proof Without Words: Triangles in the Triangular Grid, arXiv:2211.00186"
  },
  "models": [],
  "relations": [
    {
      "slug": "R789",
      "title": "The current certified interval is 33 through 56",
      "object_type": "claim",
      "relation": "contextualizes",
      "direction": "outgoing"
    },
    {
      "slug": "triangular-lattice-15-equilateral-free",
      "title": "triangular lattice 15 equilateral free",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A route someone took, recorded so the next person can reuse it or avoid it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.