The existence of square non-integer Heffter arrays
Nicholas J. Cavenagh, Jeff Dinitz, Diane Donovan, Sule Yaz{\i}c{\i}

TL;DR
This paper proves the existence of non-integer square Heffter arrays for all parameters where the array size exceeds the number of filled cells per row and column, expanding the known existence results.
Contribution
It establishes the existence of non-integer square Heffter arrays for all cases with 3 ≤ k < n, generalizing previous integer-only results.
Findings
Non-integer square Heffter arrays exist for all n and k with 3 ≤ k < n.
This extends the known existence conditions beyond integer arrays.
Provides new constructions for non-integer Heffter arrays.
Abstract
A Heffter array is an matrix such that each row and column contains filled cells, each row and column sum is divisible by and either or appears in the array for each integer . Heffter arrays are useful for embedding the graph on an orientable surface. An integer Heffter array is one in which each row and column sum is . Necessary and sufficient conditions (on and ) for the existence of an integer Heffter array were verified by Archdeacon, Dinitz, Donovan and Yaz\i c\i \ (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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Limits and Structures in Graph Theory
