Existence of $\lambda$-Fold Non-zero sum Heffter arrays through local considerations
Simone Costa, Stefano Della Fiore

TL;DR
This paper extends the concept of non-zero sum Heffter arrays to arbitrary finite groups, proving their existence under certain conditions using probabilistic methods, and explores their applications in graph embeddings.
Contribution
It generalizes the existence results of $ ext{N} ext{H}_t(m,n; h,k)$ arrays to all finite groups for any $ ext{lambda}$, using local probabilistic considerations.
Findings
Existence of $ ext{N} ext{H}_t(m,n; h,k)$ arrays for groups of order at least 41.
Reduced the order requirement to 29 for arrays without empty cells.
Constructed new infinite families of biembeddings of multigraphs into orientable surfaces.
Abstract
In [12] was introduced, for cyclic groups, the class of partially filled arrays of the non-zero sum Heffter array that are, as the Heffter arrays, related to difference families, graph decompositions, and biembeddings. Here we generalize this definition to any finite groups. Given a subgroup of order of a group , a -fold non-zero sum Heffter array over relative to , , is an p. f. array with entries in such that: each row contains filled cells and each column contains filled cells; for every , the sum of the occurrence of and is ; the sum of the elements in every row and column is, following the natural orderings from left to right for the rows and from top to bottom for the columns, different from (in ). In [12], there was presented a complete,…
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
