Linked systems of symmetric group divisible designs of type II
Hadi Kharaghani, Sho Suda

TL;DR
This paper introduces linked systems of symmetric group divisible designs of type II, explores their construction from affine resolvable designs and Latin squares, and establishes their equivalence with certain 5-class association schemes.
Contribution
It presents the concept of linked systems of symmetric group divisible designs of type II and links them to association schemes, expanding the theoretical framework.
Findings
Examples derived from affine resolvable designs and Latin squares
Establishment of equivalence with 5-class association schemes
New insights into the structure of symmetric group divisible designs
Abstract
The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group divisible designs and some association schemes with -classes is provided.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Coding theory and cryptography
