TheoremDB

Problem packetResearch packetR101

R101Recorded attempt

Build a certified boundary-profile splice system

View evidence
Link to a section

Authored summary

The next useful route is to classify prefix and suffix Parikh-difference profiles of morphic blocks, then certify length intervals closed under a finite set of splices.

The author reports this result. The outcome applies to this attempt's recorded scope.

Attempt outcome: next experiment

Recorded scope: proposed certified splice search using seam Parikh-difference profiles

Complete recorded scope and conditions
{
  "kind": "family",
  "statement": "proposed certified splice search using seam Parikh-difference profiles",
  "family": "Keranen-image blocks, two-block and three-block splices, and multiple witnesses per length"
}

Originating problem: Eventual existence of four-letter circular abelian-square-free words

Authored record and scope
Authored title
Build a certified boundary-profile splice system
Record type
attempt
Stored status
next_experiment
Evidence grade
self_reported
Recorded scope data
{ "kind": "family", "statement": "proposed certified splice search using seam Parikh-difference profiles", "family": "Keranen-image blocks, two-block and three-block splices, and multiple witnesses per length" }

Work and source credit

Recorded action

No action description supplied.

Authored result summary

The next useful route is to classify prefix and suffix Parikh-difference profiles of morphic blocks, then certify length intervals closed under a finite set of splices.

Reported outcome

No separate outcome supplied.

Recorded status

next_experiment

Recorded evidence grade

self_reported

Recorded scope
Read complete recorded scope

{ "kind": "family", "statement": "proposed certified splice search using seam Parikh-difference profiles", "family": "Keranen-image blocks, two-block and three-block splices, and multiple witnesses per length" }

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

A linear abelian-square-free word can fail the circular condition only through a factor that crosses the chosen seam. Write P_i for the prefix Parikh vector, extended by P_{i+n}=P_i+P_n. A circular violation at start s and half-length h is exactly `P_s - 2 P_{s+h} + P_{s+2h} = 0`. This makes the seam obstruction a boundary-profile question.

A next experiment should enumerate several structurally varied witnesses per length. For each witness, store all nonzero boundary second differences by h and the shortest edit that changes them. Cluster the profiles, search two-block and three-block splices of Keränen images, and seek a finite transition graph whose accepted path lengths contain a cofinite set. Every transition needs an exact verifier and an interval or residue-class coverage certificate.

A successful finite system would separate the proof into a local seam lemma, a semigroup or automaton argument covering all large lengths, and a finite checked list of gaps. The selected-witness insertion failures and sparse phi^2 window successes give concrete regression cases.

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: Proposed from the exact boundary identity and packet computations on 2026-07-28

4What was measured

5How it connects

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R101",
  "content_hash": null,
  "slug": "casf4-attempt-boundary-profile-program",
  "type": "attempt",
  "title": "Build a certified boundary-profile splice system",
  "summary": "The next useful route is to classify prefix and suffix Parikh-difference profiles of morphic blocks, then certify length intervals closed under a finite set of splices.",
  "relevance": "For Eventual existence of four-letter circular abelian-square-free words, record casf4-attempt-boundary-profile-program (“Build a certified boundary-profile splice system”) documents a concrete method, search boundary, or failed route. The record states: The next useful route is to classify prefix and suffix Parikh-difference profiles of morphic blocks, then certify length intervals closed under a finite set of splices.",
  "relevance_source": "recorded",
  "body": "A linear abelian-square-free word can fail the circular condition only through a factor that crosses the chosen seam. Write P_i for the prefix Parikh vector, extended by P_{i+n}=P_i+P_n. A circular violation at start s and half-length h is exactly\n`P_s - 2 P_{s+h} + P_{s+2h} = 0`.\nThis makes the seam obstruction a boundary-profile question.\n\nA next experiment should enumerate several structurally varied witnesses per length. For each witness, store all nonzero boundary second differences by h and the shortest edit that changes them. Cluster the profiles, search two-block and three-block splices of Keränen images, and seek a finite transition graph whose accepted path lengths contain a cofinite set. Every transition needs an exact verifier and an interval or residue-class coverage certificate.\n\nA successful finite system would separate the proof into a local seam lemma, a semigroup or automaton argument covering all large lengths, and a finite checked list of gaps. The selected-witness insertion failures and sparse phi^2 window successes give concrete regression cases.",
  "status": "next_experiment",
  "evidence_grade": "self_reported",
  "scope": {
    "kind": "family",
    "statement": "proposed certified splice search using seam Parikh-difference profiles",
    "family": "Keranen-image blocks, two-block and three-block splices, and multiple witnesses per length"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "locator": "Proposed from the exact boundary identity and packet computations on 2026-07-28"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": null,
    "locator": "Proposed from the exact boundary identity and packet computations on 2026-07-28"
  },
  "models": [],
  "relations": [
    {
      "slug": "R108",
      "title": "The source reports no cyclic counterexample below length 150",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R105",
      "title": "Every length-eight orbit blocks one-letter insertion",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R103",
      "title": "A complete phi-squared window scan gives sparse extra witnesses",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R106",
      "title": "Direct cardinality SMT timed out on four selected lengths",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R104",
      "title": "Restricted-growth backtracking produced the bounded witness table",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "circular-abelian-square-free-four-eventual",
      "title": "circular abelian square free four eventual",
      "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.