Heffter spaces
From MaRDI portal
Publication:6597207
DOI10.1016/j.ffa.2024.102464MaRDI QIDQ6597207
Publication date: 3 September 2024
Published in: Finite Fields and their Applications (Search for Journal in Brave)
configurationnetpartial linear spacecyclotomyresolvabilitydifference packingHeffter arrayHeffter systemadditive designorthogonal cycle systems
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the additivity of block designs
- Translation nets and fixed-point-free group automorphisms
- On large sets of disjoint Steiner triple systems. IV
- Square integer Heffter arrays with empty cells
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Translation nets: A survey
- On the maximal number of pairwise orthogonal Steiner triple systems
- Skolem-type difference sets for cycle systems
- A problem on partial sums in abelian groups
- Cyclotomic construction of strong external difference families in finite fields
- Orthogonal decomposition and packing of complete graphs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Sets of three pairwise orthogonal Steiner triple systems
- Resolvable configurations
- Binary Hamming codes and Boolean designs
- Additivity of affine designs
- Super-regular Steiner 2-designs
- On resolvable Golomb rulers, symmetric configurations and progressive dinner parties
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Heffter arrays and biembedding graphs on surfaces
- The Nagell-Ljunggren equation via Runge's method
- Construction and nonexistence of strong external difference families
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Designing Progressive Dinner Parties
- On perfect Γ-decompositions of the complete graph
- The Spectrum of Orthogonal Steiner Triple Systems
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Biembedding Steiner Triple Systems and n-cycle Systems on Orientable Surfaces
- The existence of square integer Heffter arrays
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Primary cyclotomic units and a proof of Catalans conjecture
- New results on modular Golomb rulers, optical orthogonal codes and related structures
- On strongly sequenceable abelian groups
- The existence of square non-integer Heffter arrays
- On the Nonexistence of Orthogonal Steiner Systems of Order 9
- Mutually orthogonal cycle systems
- Relative difference sets
- Orthogonal cycle systems with cycle length less than 10
- Tight Heffter arrays from finite fields
- A survey of Heffter arrays
- Additivity of symmetric and subspace 2-designs
This page was built for publication: Heffter spaces