{
  "schema_version": 1,
  "problem_number": "AMR-014-0004",
  "title": "Counterexamples to a Conjecture of Fröberg, Lundqvist, Oneto and Shapiro on Maximal k-Ranks of Binary Forms",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "abstract": "For a complex binary form f of degree kd, the k-rank of f is the least number of k-th powers of binary forms of degree d whose sum is f. Fröberg, Lundqvist, Oneto and Shapiro conjectured (Arnold Math. J. 4 (2018), Conjecture 1.9) that for all k and d the maximal k-rank of binary forms of degree kd equals k, and that the forms ℓ1ℓ2^(kd−1), with non-proportional linear forms ℓ1, ℓ2, attain it. We show that xy^(kd−1) is a sum of fewer than k k-th powers of forms of degree d for every d ≥ 2 when k ∈ {5, 6, 7, 8, 9} or k is odd with 7 ≤ k ≤ 201; so the conjecture is false for all these (k, d). For k = 7 the counterexample is a closed-form identity whose proof needs no computer: xy^13 is a linear combination of six 7th powers of explicit binary quadratic forms, built from √165, a cube root, two square roots and a cube root of unity, and hence a sum of six 7th powers. The same construction gives k − 1 terms for odd k ≥ 7 whenever three conditions on two explicit integer polynomials hold; they were checked by exact computer calculation for 7 ≤ k ≤ 201. This construction is a variant of Reznick's \"synching\" of powers of quadratic forms. For k = 5, 6, 8, 9 the identities, with 4, 5, 6, 7 terms, are computer-assisted: an interval Newton test of Krawczyk type, carried out in exact rational and interval arithmetic by several independent programs, proves that an exact solution exists next to an approximate one. By results of Lundqvist, Oneto, Reznick and Shapiro, of Carlini and Oneto, and of Bik, Draisma, Oneto and Ventura, the conjecture holds at (k, d) = (3, 2), (3, 3), (3, 4), (4, 2), so (5, 2) is the first failure in the order of k for d = 2; the case k = 4, d ≥ 3 remains open, and so does the first clause alone (maximal k-rank equal to k) outside the known cases. The same identities answer Problem D of the source, on k-ranks of binary monomials, in the negative, and they give upper bounds below N in Heilbronn's problem on sums of N-th powers of entire functions and in its analogue for polynomials, the Waring number of C[t]. We found no such bound in the literature accessible to us, but two primary sources could not be read. This is an unrefereed note.",
  "result_type": "COMPLETE_COUNTEREXAMPLE",
  "categories": [
    "math.AG",
    "math.AC"
  ],
  "keywords": [
    "k-rank",
    "maximal k-rank",
    "binary forms",
    "sums of powers of forms",
    "Waring problem for forms",
    "counterexample",
    "Heilbronn's problem",
    "Waring number of C[t]",
    "computer-assisted proof",
    "interval arithmetic",
    "Krawczyk test",
    "Arnold Mathematical Journal problems",
    "UnsolvedMath",
    "AMR-014-0004",
    "math.AG",
    "math.AC",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-10-14",
  "publication_date": "2026-10-14",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-10-14",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/amr-014-0004/",
  "pdf_url": "https://eulersolve.org/papers/amr-014-0004/paper.pdf?v=f6f277ac5523",
  "doi": "10.5281/zenodo.23369280",
  "zenodo_record_url": "https://zenodo.org/records/23369280",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Refutes Conjecture 1.9 of Fröberg, Lundqvist, Oneto and Shapiro (Arnold Math. J. 4 (2018)) on maximal k-ranks of binary forms: x·y^(kd−1) is a sum of fewer than k k-th powers of forms of degree d for every d ≥ 2 when k ∈ {5,…,9} or k is odd with 7 ≤ k ≤ 201; the k = 7 identity is computer-free, k = 5, 6, 8, 9 rest on interval certificates; which clause fails is not decided. Also answers Problem D of the source (record AMR-014-0006) in the negative. The construction is a variant of Reznick's synching. Two primary sources on Heilbronn's problem could not be read. Novelty is not certified.",
  "files": {
    "paper.pdf": {
      "sha256": "f6f277ac552328ce4170d3057609e8669c8d2d083f3b7a17ea9298220a685586"
    },
    "source.zip": {
      "sha256": "c4b2b3fe305aad2a11e835a043dbe2a5e75484697c43ad441e100add54bb4f0f"
    },
    "verification_report.md": {
      "sha256": "76f507bf0ed4bae23650cdccd2ca3e01a87d263288558b3d979225f2635231e8"
    }
  },
  "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."
}