This paper introduces the concept of a Heffter space, a novel combinatorial design that generalizes the Heffter array. A Heffter array, which has been an area of significant interest over the past decade, is equivalent to a pair of orthogonal Heffter systems. The authors explore the existence problem for sets of \(r\) mutually orthogonal Heffter systems (MOHS) for any \(r\). They establish that such a set is equivalent to a resolvable partial linear space of degree \(r\) whose parallel classes are themselves Heffter systems. The main results include constructing Heffter spaces with odd block sizes and arbitrarily large degrees \(r\). Specifically, showing that for any odd integer \(k\geq 3\) and any positive integer \(r\), there are infinitely many values of \(v\) such that there exists a set of \(r\) mutually orthogonal Heffter systems of order \(v\) and block size \(k\).\N\NAdditionally, the paper addresses the more challenging case of constructing Heffter spaces with even block sizes, noting that achieving similar results in this scenario seems challenging. However, the authors are preparing a separate paper that will present several constructions for Heffter spaces with even block sizes, although with a limited degree \(r\).\N\NThis research has raised an open problem, namely the existence of Heffter linear spaces. The study contributes significantly to the field of combinatorial design theory by introducing new structures and methodologies for constructing MOHS, paving the way for further advancements in this interdisciplinary domain.
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- A problem on partial sums in abelian groups
- A survey of Heffter arrays
- Additivity of affine designs
- Additivity of symmetric and subspace 2-designs
- Biembedding Steiner triple systems and n-cycle systems on orientable surfaces
- Binary Hamming codes and Boolean designs
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Construction and nonexistence of strong external difference families
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cyclotomic construction of strong external difference families in finite fields
- Designing progressive dinner parties
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Heffter arrays and biembedding graphs on surfaces
- scientific article; zbMATH DE number 3931025 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- scientific article; zbMATH DE number 3430675 (Why is no real title available?)
- Mutually orthogonal cycle systems
- New results on modular Golomb rulers, optical orthogonal codes and related structures
- On large sets of disjoint Steiner triple systems. IV
- On perfect Γ-decompositions of the complete graph
- On resolvable Golomb rulers, symmetric configurations and progressive dinner parties
- On strongly sequenceable abelian groups
- On the additivity of block designs
- On the maximal number of pairwise orthogonal Steiner triple systems
- On the Nonexistence of Orthogonal Steiner Systems of Order 9
- Orthogonal cycle systems with cycle length less than 10
- Orthogonal decomposition and packing of complete graphs
- Primary cyclotomic units and a proof of Catalans conjecture
- Relative difference sets
- Resolvable configurations
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Sets of three pairwise orthogonal Steiner triple systems
- Skolem-type difference sets for cycle systems
- Square integer Heffter arrays with empty cells
- Super-regular Steiner 2-designs
- The existence of square integer Heffter arrays
- The existence of square non-integer Heffter arrays
- The Nagell-Ljunggren equation via Runge's method
- The Spectrum of Orthogonal Steiner Triple Systems
- Tight Heffter arrays from finite fields
- Translation nets and fixed-point-free group automorphisms
- Translation nets: A survey
This page was built for publication: Heffter spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597207)
