TheoremDB

Problem packetResearch packetR742

R742Recorded attempt

Published growth and asymptotic results stop short of the requested comparison

View evidenceOpen source ↗
Link to a section

Authored summary

The located papers identify the coefficient and its limit; neither supplies strict normalized monotonicity from n=16.

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

Attempt outcome: inconclusive

Recorded scope: published results directly concerning the central coefficient of product from k=1 to n of (1+x^k), its asymptotics, and monotonicity

Complete recorded scope and conditions
{
  "kind": "bounded",
  "statement": "published results directly concerning the central coefficient of product from k=1 to n of (1+x^k), its asymptotics, and monotonicity",
  "bounds": {
    "search_date": {
      "min": 20260724,
      "max": 20260724
    }
  },
  "exhaustive": false
}

Originating problem: Eventual monotonicity in a signed subset-sum local limit

Authored record and scope
Authored title
Published growth and asymptotic results stop short of the requested comparison
Record type
attempt
Stored status
inconclusive
Evidence grade
sourced
Recorded scope data
{ "kind": "bounded", "statement": "published results directly concerning the central coefficient of product from k=1 to n of (1+x^k), its asymptotics, and monotonicity", "bounds": { "search_date": { "min": 20260724, "max": 20260724 } }, "exhaustive": false }

Work and source credit

Recorded action

No action description supplied.

Authored result summary

The located papers identify the coefficient and its limit; neither supplies strict normalized monotonicity from n=16.

Reported outcome

No separate outcome supplied.

Recorded status

inconclusive

Recorded evidence grade

sourced

Recorded scope
Read complete recorded scope

{ "kind": "bounded", "statement": "published results directly concerning the central coefficient of product from k=1 to n of (1+x^k), its asymptotics, and monotonicity", "bounds": { "search_date": { "min": 20260724, "max": 20260724 } }, "exhaustive": false }

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

Andrica and Tomescu identify \(C_n\) as the middle coefficient of \(\prod_{k=1}^n(1+x^k)\), derive an integral representation, and prove the constructive bound \(C_n\geq6C_{n-4}\) for \(n\geq8\). Their bound compares indices four apart and concerns the unnormalized count.

Sullivan proves the Andrica-Tomescu asymptotic by Laplace's method. The proof separates a neighborhood of zero in the cosine-product integral and shows the remaining integral is lower order. Its conclusion is a first-order equivalence as \(n\to\infty\). The paper states no effective error bound that decides each adjacent admissible comparison.

OEIS A063865 records the exact sequence and points to both papers. Searches for the sequence identifier, normalized central coefficients, weighted Rademacher local limits, and monotonicity found no direct theorem for the present claim. This is a targeted audit rather than a proof of novelty.

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: cs.uwaterloo.ca ↗, Andrica and Tomescu, Journal of Integer Sequences 5 (2002), Article 02.2.4; Sullivan, Journal of Integer Sequences 16 (2013), Article 13.3.1; OEIS A063865; search performed 2026-07-24

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": "R742",
  "content_hash": null,
  "slug": "ssclt-attempt-literature-audit",
  "type": "attempt",
  "title": "Published growth and asymptotic results stop short of the requested comparison",
  "summary": "The located papers identify the coefficient and its limit; neither supplies strict normalized monotonicity from n=16.",
  "relevance": "For Eventual monotonicity in a signed subset-sum local limit, record ssclt-attempt-literature-audit (“Published growth and asymptotic results stop short of the requested comparison”) documents a concrete method, search boundary, or failed route. The record states: The located papers identify the coefficient and its limit; neither supplies strict normalized monotonicity from n=16.",
  "relevance_source": "recorded",
  "body": "Andrica and Tomescu identify \\(C_n\\) as the middle coefficient of \\(\\prod_{k=1}^n(1+x^k)\\), derive an integral representation, and prove the constructive bound \\(C_n\\geq6C_{n-4}\\) for \\(n\\geq8\\). Their bound compares indices four apart and concerns the unnormalized count.\n\nSullivan proves the Andrica-Tomescu asymptotic by Laplace's method. The proof separates a neighborhood of zero in the cosine-product integral and shows the remaining integral is lower order. Its conclusion is a first-order equivalence as \\(n\\to\\infty\\). The paper states no effective error bound that decides each adjacent admissible comparison.\n\nOEIS A063865 records the exact sequence and points to both papers. Searches for the sequence identifier, normalized central coefficients, weighted Rademacher local limits, and monotonicity found no direct theorem for the present claim. This is a targeted audit rather than a proof of novelty.",
  "status": "inconclusive",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "bounded",
    "statement": "published results directly concerning the central coefficient of product from k=1 to n of (1+x^k), its asymptotics, and monotonicity",
    "bounds": {
      "search_date": {
        "min": 20260724,
        "max": 20260724
      }
    },
    "exhaustive": false
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://cs.uwaterloo.ca/journals/JIS/VOL16/Sullivan/sullivan8.html",
      "locator": "Andrica and Tomescu, Journal of Integer Sequences 5 (2002), Article 02.2.4; Sullivan, Journal of Integer Sequences 16 (2013), Article 13.3.1; OEIS A063865; search performed 2026-07-24"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://cs.uwaterloo.ca/journals/JIS/VOL16/Sullivan/sullivan8.html",
    "locator": "Andrica and Tomescu, Journal of Integer Sequences 5 (2002), Article 02.2.4; Sullivan, Journal of Integer Sequences 16 (2013), Article 13.3.1; OEIS A063865; search performed 2026-07-24"
  },
  "models": [],
  "relations": [
    {
      "slug": "R743",
      "title": "The all-n monotonicity claim remains unresolved in this audit",
      "object_type": "claim",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "signed-subset-sum-local-clt-monotone",
      "title": "signed subset sum local clt monotone",
      "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.