Integer relative Heffter-array existence problem

Determine whether a square integer relative Heffter array H5(n;5)\mathrm{H}_5(n;5) exists for every integer n≥8n\ge 8 satisfying n≡0(mod4)n\equiv 0\pmod{4}. The 2026 source claims an affirmative answer: such arrays exist for n=8n=8 and for every n≥12n\ge 12 with n≡0(mod4)n\equiv 0\pmod{4}.

References

Primary source

arXiv

Progress summary

Refreshed
Claimed solved

A 2026 paper claims to settle the last missing family of this existence problem, but the construction has not been independently verified here.

The problem asks when square integer relative Heffter arrays Hk(n;k)H_k(n;k) exist. Before 2026, every case was settled except k=5k=5 with n≡0(mod4)n\equiv 0\pmod{4}, aside from sporadic examples.

Known results

  • For k≠5k\ne 5, existence is classified for 3≤k≤n3\le k\le n (2019).
  • For k=5k=5, arrays exist when n≡3(mod4)n\equiv 3\pmod{4} and do not exist when n≡1,2(mod4)n\equiv 1,2\pmod{4} (2019).
  • In the remaining class k=5k=5, n≡0(mod4)n\equiv 0\pmod{4}, examples were known at n=8n=8 and n=16n=16 (2019).

2026 completion

Lorenzo Mella's 2026 arXiv paper, Completing the Existence Problem for Integer Relative Heffter Arrays Hk(n;k)H_k(n;k), claims constructions for k=5k=5, n≡0(mod4)n\equiv 0\pmod{4}, with general construction for n≥16n\ge 16 and supplementary examples at n=8n=8 and n=12n=12. It states that the existence problem is completely settled.

Current status (as of September 2026): The classification is claimed complete, including k=5k=5, n≡0(mod4)n\equiv 0\pmod{4}, but the new construction remains unverified in this report.

Sources

Solutions 0

No solutions have been posted yet.