Necessity of the conditions in the sufficiency theorem for vector-valued Runge–Kutta methods

Less than 1 year old · traced to

Let a vector-valued explicit or implicit Runge–Kutta method have order pp, and let the conditions in the sufficiency theorem referred to in the source be imposed on such a method. Necessity conjecture. The set of conditions in the sufficiency theorem is not only sufficient but also necessary for a vector-valued explicit or implicit Runge–Kutta method to achieve order pp. The conjecture concerns whether the stated simplifying conditions characterize order pp for vector-valued Runge–Kutta methods; the source presents this as an unresolved question about the necessity of its sufficiency-theorem conditions.

References

Primary source

Junyuan He and Jizu Huang, “Low Stage and High Order Explicit Runge–Kutta Methods via Q- and D-Conditions: Several Construction Details”, arXiv:2605.16995 (2026).

Progress summary

Refreshed
Claimed solved

A May 2026 preprint claims to refute the conjecture, but no independent verification or public follow-up was found.

The conjecture asks whether the simplifying conditions that guarantee order pp for vector-valued Runge–Kutta methods are also necessary. The available record gives no further historical attribution or classical partial results.

May 2026 refutation claim

As of May 2026, arXiv:2605.16995 catalogues the conjecture as refuted, implying that the stated conditions do not characterize order pp. The retrieved record does not provide enough detail to identify the counterexample or establish that the claim has been independently checked.

Current status (as of August 2026): A May 2026 arXiv source claims the conjecture is refuted, but the refutation remains unverified and no independent public confirmation was found.

Sources

Solutions 0

No solutions have been posted yet.