Sums of seven octahedral numbers
Zarathustra Brady

TL;DR
This paper proves that all sufficiently large numbers can be expressed as sums of seven positive values of certain cubic polynomials, including octahedral numbers, reducing an open problem to finite computation.
Contribution
It establishes a general result for sums of seven positive values of cubic polynomials, specifically solving the open problem for octahedral numbers.
Findings
Every number greater than e^{10^7} is a sum of seven positive octahedral numbers.
Reduces the open problem of representing large numbers as sums of octahedral numbers to finite computation.
Provides a general framework for representing large numbers as sums of polynomial values.
Abstract
We show that for a large class of cubic polynomials , every sufficiently large number can be written as a sum of seven positive values of . As a special case, we show that every number greater than is a sum of seven positive octahedral numbers, where an octahedral number is a number of the form , reducing an open problem due to Pollock to a finite computation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
