The existence of square integer Heffter arrays

Jeffrey H. Dinitz, Ian M. Wanless


An integer Heffter array H(m, n; s, t) is an m × n partially filled matrix with entries from the set { ± 1,  ± 2, …,  ± ms} such that i) each row contains s filled cells and each column contains t filled cells, ii) every row and column sums to 0 (in Z), and iii) no two entries agree in absolute value. Heffter arrays are useful for embedding the complete graph K2ms + 1 on an orientable surface in such a way that each edge lies between a face bounded by an s-cycle and a face bounded by a t-cycle. In 2015, Archdeacon, Dinitz, Donovan and Yazici constructed square (i.e. m = n) integer Heffter arrays for many congruence classes. In this paper we construct square integer Heffter arrays for all the cases not found in that paper, completely solving the existence problem for square integer Heffter arrays.


Heffter array, biembedding

Full Text:


ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications