TheoremDB

Problem packetResearch packetR75

R75Recorded attempt

Find an integer recurrence or a vanishing counterexample

View evidenceOpen source ↗
Link to a section

Authored summary

The next search starts at order 5,000, while a proof must control even nonzero determinants as well as odd ones.

The recorded evidence grade has no defined assessment here. The outcome applies to this attempt's recorded scope.

Attempt outcome: open strategy

Recorded scope: No scope is recorded.

Originating problem: Nonvanishing of Baum-Sweet Hankel determinants

Authored record and scope
Authored title
Find an integer recurrence or a vanishing counterexample
Record type
attempt
Stored status
open_strategy
Evidence grade
proposed

Work and source credit

Recorded action

No action description supplied.

Authored result summary

The next search starts at order 5,000, while a proof must control even nonzero determinants as well as odd ones.

Reported outcome

No separate outcome supplied.

Recorded status

open_strategy

Recorded evidence grade

proposed

Recorded scope

No explicit scope supplied.

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

Finite-field parity formulas cannot prove this claim because many of the integer determinants are even. A useful route would derive a recurrence for the integer leading minors from the 2-kernel of the sequence. A counterexample search should retain code and begin at \(n=5000\).

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: doi.org ↗, Mills and Robbins, Continued fractions for certain algebraic power series, Journal of Number Theory 23 (1986), pages 388-404

4How 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": "R75",
  "content_hash": null,
  "slug": "bsh-attempt-integer-nonvanishing",
  "type": "attempt",
  "title": "Find an integer recurrence or a vanishing counterexample",
  "summary": "The next search starts at order 5,000, while a proof must control even nonzero determinants as well as odd ones.",
  "relevance": "For Nonvanishing of Baum-Sweet Hankel determinants, record bsh-attempt-integer-nonvanishing (“Find an integer recurrence or a vanishing counterexample”) documents a concrete method, search boundary, or failed route. The record states: The next search starts at order 5,000, while a proof must control even nonzero determinants as well as odd ones.",
  "relevance_source": "recorded",
  "body": "Finite-field parity formulas cannot prove this claim because many of the integer determinants are even. A useful route would derive a recurrence for the integer leading minors from the 2-kernel of the sequence. A counterexample search should retain code and begin at \\(n=5000\\).",
  "status": "open_strategy",
  "evidence_grade": "proposed",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.1016/0022-314X(86)90083-1",
      "locator": "Mills and Robbins, Continued fractions for certain algebraic power series, Journal of Number Theory 23 (1986), pages 388-404"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1016/0022-314X(86)90083-1",
    "locator": "Mills and Robbins, Continued fractions for certain algebraic power series, Journal of Number Theory 23 (1986), pages 388-404"
  },
  "models": [],
  "relations": [
    {
      "slug": "R74",
      "title": "One-prime modular audit through order 4,999",
      "object_type": "artifact",
      "relation": "uses",
      "direction": "outgoing"
    },
    {
      "slug": "baum-sweet-hankel-nonvanishing",
      "title": "baum sweet hankel nonvanishing",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

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.