Search arXivSearch

arXiv · 2609.24399

Completing the Existence Problem for Integer Relative Heffter Arrays $\mathrm{H}_k(n;k)$

Abstract

Heffter arrays, introduced by Archdeacon in 2015, are combinatorial structures with applications to cyclic cycle systems and biembeddings of graphs on surfaces. Costa, Morini, Pasotti and Pellegrini proposed in 2020 the notion of relative Heffter arrays as a generalization of classical Heffter arrays, inspired by the concept of relative difference families. In their work, the existence problem of integer relative Heffter arrays $\mathrm{H}_k(n;k)$ was solved for all $k\neq 5$, while the case $k=5$ and $n \equiv 0 \pmod{4}$ remained open, apart from two sporadic examples with $n=8,16$. In this article, we consider this open problem and we construct an $\mathrm{H}_5(n;5)$ for every $n\equiv 0 \pmod{4}$, $n\geq 12$. As a consequence, the existence problem of integer relative $\mathrm{H}_k(n;k)$ is completely settled.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lorenzo Mella. 2026-09-21. Completing the Existence Problem for Integer Relative Heffter Arrays $\mathrm{H}_k(n;k)$. https://arxiv.org/abs/2609.24399

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

KEEP EXPLORING

Related papers

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

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