The existence of square non-integer Heffter arrays
Abstract
A Heffter array H(n;k) is an n× n matrix such that each row and column contains k filled cells, each row and column sum is divisible by 2nk+1 and either x or -x appears in the array for each integer 1≤ x≤ nk. Heffter arrays are useful for embedding the graph K2nk+1 on an orientable surface. An integer Heffter array is one in which each row and column sum is 0. Necessary and sufficient conditions (on n and k) for the existence of an integer Heffter array H(n;k) were verified by Archdeacon, Dinitz, Donovan and Yaz c \ (2015) and Dinitz and Wanless (2017). In this paper we consider square Heffter arrays that are not necessarily integer. We show that such Heffter arrays exist whenever 3≤ k<n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.