Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.08302

An update on the existence of integer Heffter arrays

Fiorenza Morini·Marco Antonio Pellegrini
View original source ↗Read source document ↗Export metadata ↓

Abstract

An integer Heffter array $H(m,n;s;k)$ is an $m\times n$ partially filled array whose entries are the elements of a subset $Ω\subset \mathbb{Z}$ such that $\{Ω,-Ω\}$ is a partition of the set $\{1,2,\ldots,2nk\}$ and such that the following conditions are satisfied: each row contains $s$ filled cells, each column contains $k$ filled cells, the elements in every row and column add up to $0$. It was conjectured by Dan Archdeacon that an integer $\H(m,n;s;k)$ exists if and only if $ms=nk$, $3\leq s \leq n$, $3\leq k\leq m$ and $nk\equiv 0,3\pmod 4$. In this paper, we provide new constructions of these objects that allow us to prove the validity of Archdeacon's conjecture in each admissible case, except when $k=3,5$ and $s\not \equiv 0\pmod 4$ is such that $\gcd(s,k)=1$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fiorenza Morini, Marco Antonio Pellegrini. 2025-10-09. An update on the existence of integer Heffter arrays. https://arxiv.org/abs/2510.08302

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗