Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Square Integer Heffter Arrays with Empty Cells (1412.8409v1)

Published 29 Dec 2014 in math.CO

Abstract: A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and $iii)$ no element from ${x,-x}$ appears twice. Heffter arrays are useful in embedding the complete graph $K{2nm+1}$ on an orientable surface where the embedding has the property that each edge borders exactly one $s-$cycle and one $t-$cycle. Archdeacon, Boothby and Dinitz proved that these arrays can be constructed in the case when $s=m$, i.e. every cell is filled. In this paper we concentrate on square arrays with empty cells where every row sum and every column sum is $0$ in $\mathbb{Z}$. We solve most of the instances of this case.

Summary

We haven't generated a summary for this paper yet.