Linked systems of symmetric group divisible designs

2016/09/17 by Hadi Kharaghani, Kharaghani, Hadi, Sho Suda +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1609.05255

openalex publication_date 2016/09/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which are linked. Several examples of linked systems of symmetric group divisible designs are provided.

Related

• Linked systems of symmetric group divisible designs of type II
• Linked systems of symmetric designs
• Linking systems of difference sets
• Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes
• Divisible design digraphs and association schemes