Tight Heffter arrays from finite fields

DOI10.1007/978-3-031-48679-1_2MaRDI QIDQ6613357zbMATH OpenFDO

Authors Marco Buratti

Publication date 2 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48679-1_2

zbMATH Keywords

equivalent Heffter arraysisomorphic Heffter arrays

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cites work

• A survey of Heffter arrays
• Cyclotomy and difference families in elementary Abelian groups
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Heffter arrays and biembedding graphs on surfaces
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
• On the additivity of block designs
• Relative Heffter arrays and biembeddings
• Row‐column factorial designs with multiple levels
• Super-regular Steiner 2-designs
• The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
• Tight Heffter arrays exist for all possible values

Cited in

(7)

• Toward a solution of Archdeacon's conjecture on integer Heffter arrays
• Heffter arrays over partial loops
• More Heffter spaces via finite fields
• A survey of Heffter arrays
• Heffter spaces
• Biembeddings of Archdeacon type: their full automorphism group and their number
• Shiftable Heffter spaces

This page was built for publication: Tight Heffter arrays from finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613357)