Divisible design digraphs and association schemes

2020/03/31 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.2004.00510

openalex publication_date 2020/03/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design digraphs.

Related

• Disjoint weighing matrices
• Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes
• Constructions of t-designs from weighing matrices and walk-regular graphs
• Non-commutative association schemes and their fusion association schemes
• Linked systems of symmetric group divisible designs