TheoremDB
R1633claimStatus: reportedEvidence: SupportedReplay: source only

[#R1633] Strongest checked neighboring result

claim. Decidability is known through order five, for simple sequences through order nine, and for additional reversible or dominant-root subclasses.

View evidenceOpen source ↗

1Summary

This leaves the following boundary unresolved: A decision procedure for unrestricted order, already beyond the low-order frontier, remains open. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.

Supported evidence. Replay readiness: source only.

2Evidence

Evidence package: source only

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

Verification source: doi.org ↗, J. Ouaknine and J. Worrell, Positivity Problems for Low-Order Linear Recurrence Sequences, SODA 2014. main decidability theorems

3What was measured

As of
2026-08-01

4How it connects

Informs

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": "R1633",
  "content_hash": null,
  "slug": "linear-recurrence-positivity-decidability-claim-literature-frontier",
  "type": "claim",
  "title": "Strongest checked neighboring result",
  "summary": "Decidability is known through order five, for simple sequences through order nine, and for additional reversible or dominant-root subclasses.",
  "relevance": "Locates the present research frontier immediately below Decidability of positivity for linear recurrence sequences.",
  "relevance_source": "recorded",
  "body": "Decidability is known through order five, for simple sequences through order nine, and for additional reversible or dominant-root subclasses.\n\nThis leaves the following boundary unresolved: A decision procedure for unrestricted order, already beyond the low-order frontier, remains open. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1137/1.9781611973402.27",
      "locator": "J. Ouaknine and J. Worrell, Positivity Problems for Low-Order Linear Recurrence Sequences, SODA 2014. main decidability theorems"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1137/1.9781611973402.27",
    "locator": "J. Ouaknine and J. Worrell, Positivity Problems for Low-Order Linear Recurrence Sequences, SODA 2014. main decidability theorems"
  },
  "relations": [
    {
      "slug": "R1634",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "linear-recurrence-positivity-decidability",
      "title": "linear recurrence positivity decidability",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
linear-recurrence-positivity-decidability-release-300-source-review
Locator
J. Ouaknine and J. Worrell, Positivity Problems for Low-Order Linear Recurrence Sequences, SODA 2014. main decidability theorems
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1633
Stable alias
linear-recurrence-positivity-decidability-claim-literature-frontier
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.