{
  "schema_version": 1,
  "problem_number": "AMR-046-0027",
  "title": "Gasull's Finite Moment Problem for Polynomials with Few Monomials",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "abstract": "Let f ∈ C[x] have at most k monomials and put M_n = ∫_0^1 f(x)^n dx. A. Gasull asked whether there is a number N(k) such that M_1 = ⋯ = M_{N(k)} = 0 forces f = 0, and, if so, for its value or a good upper bound. We show that N(k) exists for every k. The proof treats the exponents as parameters, applies Hilbert's basis theorem to the moments with their denominators cleared, and uses the known fact, proved by Pakovich and by Françoise, Pakovich, Yomdin and Zhao, that the moments ∫_0^1 f^n dx, n ≥ 1, of a nonzero polynomial cannot all vanish. It gives no explicit bound. We also show that N(k) ≥ k for every k, that N(1) = 1 and N(2) = 2, and, by an exact computer-assisted certificate, that N(3) = 3: after a linear change of variables, a resultant that controls the case k = 3 has only nonnegative coefficients. The statement for k = 3 holds for all real exponents greater than −1/3. For every k, the first k moments force f = 0 when the exponents are sufficiently lacunary. For k = 4 and k = 5 we report exact certificates for all sets of integer exponents with largest exponent at most 50 and at most 16, respectively; these are finite-range computations. Numerically, the real-exponent version of the case k = 4 fails for some exponents with e_1 < 0. The value of N(k), and any explicit upper bound for it, remain open for k ≥ 4. This is an unrefereed note.",
  "result_type": "COMPLETE_SCOPED_PROOF",
  "categories": [
    "math.CA",
    "math.AC",
    "math.DS"
  ],
  "keywords": [
    "vanishing moments",
    "polynomial moment problem",
    "polynomials with few monomials",
    "fewnomials",
    "Hilbert basis theorem",
    "Pakovich's theorem",
    "resultant",
    "positivity certificate",
    "Gasull",
    "UnsolvedMath",
    "AMR-046-0027",
    "math.CA",
    "math.AC",
    "math.DS",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-09-30",
  "publication_date": "2026-09-30",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-09-30",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/amr-046-0027/",
  "pdf_url": "https://eulersolve.org/papers/amr-046-0027/paper.pdf?v=e4d031469d0a",
  "doi": "10.5281/zenodo.23065429",
  "zenodo_record_url": "https://zenodo.org/records/23065429",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Answers part (i) of Gasull's Problem 27 (arXiv:2012.02524) affirmatively but not effectively, and part (ii) for k ≤ 3 (N(3) = 3 by an exact computer-assisted certificate). The k = 4, 5 results are finite-range computations and the real-exponent failure for k = 4 is numerical; N(k) and any explicit bound remain open for k ≥ 4.",
  "files": {
    "paper.pdf": {
      "sha256": "e4d031469d0ad11a62c24c0fd8edfa345e4b6507922e9be879a487d6400c61cd"
    },
    "source.zip": {
      "sha256": "f5256513375ee623c0f18669517fb5f517e29c2e3c141737000d3d6f6a0c6a01"
    },
    "verification_report.md": {
      "sha256": "34cfa46a498f77cebea998cefbbc2b47e1e59898e613f086e3aad7c8a19b8189"
    }
  },
  "ai_use_disclosure": "AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text."
}