Heffter spaces

DOI10.1016/J.FFA.2024.102464MaRDI QIDQ6597207FDO

Authors Marco Buratti, Anita Pasotti

Publication date 3 September 2024

Published in Finite Fields and their Applications (Search for Journal in Brave)

zbMATH Keywords

partial linear spacecyclotomyconfigurationnetresolvabilitydifference packingHeffter arrayHeffter systemadditive designorthogonal cycle systems

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other designs, configurations (05B30)

Recommendations

• Existence of \(\lambda\)-fold non-zero sum Heffter arrays through local considerations
• A survey of Heffter arrays
• Completing partial solutions to Heffter's difference problem
• Perfect permutations and spatially balanced Latin squares

Cites work

• 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?)
• 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 and orthogonal cyclic cycle decompositions
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Heffter arrays and biembedding graphs on surfaces
• 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 Nonexistence of Orthogonal Steiner Systems of Order 9
• On the additivity of block designs
• On the maximal number of pairwise orthogonal Steiner triple systems
• 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 Nagell-Ljunggren equation via Runge's method
• The Spectrum of Orthogonal Steiner Triple Systems
• The existence of square integer Heffter arrays
• The existence of square non-integer Heffter arrays
• 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)