TheoremDB

Problem packetResearch packetR478

R478Reproduced evidence

The exact maximum number of roots is 12

View evidenceOpen source ↗
Link to a section

Authored summary

A complete enumeration of all 2^30 sign vectors finds two polynomials with 12 roots and none with more.

The recorded result has been reproduced within its stated scope.

Recorded status: established

Recorded scope: degree-30 Littlewood polynomials over F_101 with constant coefficient 1

Complete recorded scope and conditions
{
  "kind": "bounded",
  "statement": "degree-30 Littlewood polynomials over F_101 with constant coefficient 1",
  "bounds": {
    "field_order": {
      "min": 101,
      "max": 101
    },
    "degree": {
      "min": 30,
      "max": 30
    },
    "sign_vectors": {
      "min": 1073741824,
      "max": 1073741824
    }
  },
  "exhaustive": true
}

Originating problem: Most roots of a degree-30 Littlewood polynomial over F_101

Authored record and scope
Authored title
The exact maximum number of roots is 12
Record type
claim
Stored status
established
Evidence grade
reproduced
Recorded scope data
{ "kind": "bounded", "statement": "degree-30 Littlewood polynomials over F_101 with constant coefficient 1", "bounds": { "field_order": { "min": 101, "max": 101 }, "degree": { "min": 30, "max": 30 }, "sign_vectors": { "min": 1073741824, "max": 1073741824 } }, "exhaustive": true }

2Authored explanation

The lexicographically first maximizing sign vector under the artifact's mask order is \[ (-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,1). \] Its distinct roots in \(\mathbb F_{101}\) are \[ \{20,30,43,47,63,64,66,72,75,93,94,96\}. \] The exhaustive calculation splits the 30 signs into two blocks of 15. It evaluates all 32,768 assignments for each block at all 101 field elements, then checks every one of the \(32{,}768^2=2^{30}\) pairs. The complete root-count histogram has two vectors with 12 roots, 50 with 10 roots, and no vector with 11 roots or more than 12. The exhaustive artifact supplies the full histogram and source.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

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

Verification source: doi.org ↗, Complete executable enumeration in lwf101-artifact-exhaustive-mitm

4How it connects

Supported by

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R478",
  "content_hash": null,
  "slug": "lwf101-claim-exact-maximum-12",
  "type": "claim",
  "title": "The exact maximum number of roots is 12",
  "summary": "A complete enumeration of all 2^30 sign vectors finds two polynomials with 12 roots and none with more.",
  "relevance": "This records a result, observation, or conjecture used to assess the target problem.",
  "relevance_source": "derived",
  "body": "The lexicographically first maximizing sign vector under the artifact's mask order is\n\\[\n(-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,1).\n\\]\nIts distinct roots in \\(\\mathbb F_{101}\\) are\n\\[\n\\{20,30,43,47,63,64,66,72,75,93,94,96\\}.\n\\]\nThe exhaustive calculation splits the 30 signs into two blocks of 15. It evaluates all 32,768 assignments for each block at all 101 field elements, then checks every one of the \\(32{,}768^2=2^{30}\\) pairs. The complete root-count histogram has two vectors with 12 roots, 50 with 10 roots, and no vector with 11 roots or more than 12. The exhaustive artifact supplies the full histogram and source.",
  "status": "established",
  "evidence_grade": "reproduced",
  "scope": {
    "kind": "bounded",
    "statement": "degree-30 Littlewood polynomials over F_101 with constant coefficient 1",
    "bounds": {
      "field_order": {
        "min": 101,
        "max": 101
      },
      "degree": {
        "min": 30,
        "max": 30
      },
      "sign_vectors": {
        "min": 1073741824,
        "max": 1073741824
      }
    },
    "exhaustive": true
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1112/S1461157016000334",
      "locator": "Complete executable enumeration in lwf101-artifact-exhaustive-mitm"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1112/S1461157016000334",
    "locator": "Complete executable enumeration in lwf101-artifact-exhaustive-mitm"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R476",
      "title": "Complete 15-plus-15 meet-in-the-middle root sweep",
      "object_type": "artifact",
      "relation": "supports",
      "direction": "incoming"
    },
    {
      "slug": "R477",
      "title": "Finite-field root bounds give context rather than this fixed value",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "littlewood-f101-max-roots-30",
      "title": "littlewood f101 max roots 30",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs 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.