Further constructions of square integer relative Heffter arrays
Abstract
A square integer relative Heffter array is an n × n array whose rows and columns sum to zero, each row and each column has exactly k entries and either x or -x appears in the array for every x ∈ Z2nk+t J, where J is a subgroup of size t. There are many open problems regarding the existence of these arrays. In this paper we construct two new infinite families of these arrays with the additional property that they are strippable. These constructions complete the existence theory for square integer relative Heffter arrays in the case where k=3 and n is prime.
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.