Tight Heffter arrays from finite fields
From MaRDI portal
Publication:6613357
DOI10.1007/978-3-031-48679-1_2zbMATH Open1548.05065MaRDI QIDQ6613357
Publication date: 2 October 2024
Cites Work
- On the additivity of block designs
- Super-regular Steiner 2-designs
- The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
- Heffter arrays and biembedding graphs on surfaces
- Cyclotomy and difference families in elementary Abelian groups
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Relative Heffter arrays and biembeddings
- Tight Heffter Arrays Exist for all Possible Values
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
- Row‐column factorial designs with multiple levels
- A survey of Heffter arrays
Related Items (2)
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)
