Towards a solution of Archdeacon's conjecture on integer Heffter arrays
Abstract
In this paper, we make significant progress on a conjecture proposed by Dan Archdeacon on the existence of integer Heffter arrays H(m,n;s,k) whenever the necessary conditions hold, that is, 3≤slant s ≤slant n, 3≤slant k≤slant m, ms=nk and nk 0,3 4. By constructing integer Heffter array sets, we prove the conjecture in the affirmative whenever k≥slant 7· (s,k) is odd and s≠ 3,5,6,10.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.