Constructions of \(t\)-designs from weighing matrices and association schemes

We provide a method to construct \(t\)-designs from weighing matrices and association schemes. One instance of our method can produce a \(3\)-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to a question of Gunderson and Semeraro JCTB 2017. We explore variations of our method on some matrices that satisfy certain combinatorial restrictions. In particular, we show that there exist various infinite families of partially balanced incomplete block designs with block size four on the binary Hamming schemes and the \(3\)-class association schemes attached to symmetric designs, and regular pairwise balanced designs with block sizes three and four. Mathematics Subject Classifications: 05B05, 05C50, 05E30 Keywords: \(t\)-design, characteristic polynomial, weighing matrix, Hadamard matrix, association scheme

Authors

Publication Details

Journal
Combinatorial Theory
Published
2026-08-20
DOI
https://doi.org/10.5070/c6.68661
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Constructions of \(t\)-designs from weighing matrices and association schemes

Sho Suda, Gary R. W. Greaves
Combinatorial Theory
graph theory and CDMA systems
article

Constructions of \(t\)-designs from weighing matrices and association schemes

Sho Suda, Gary R. W. Greaves
article en

Abstract

We provide a method to construct \(t\)-designs from weighing matrices and association schemes. One instance of our method can produce a \(3\)-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to a question of Gunderson and Semeraro JCTB 2017. We explore variations of our method on some matrices that satisfy certain combinatorial restrictions. In particular, we show that there exist various infinite families of partially balanced incomplete block designs with block size four on the binary Hamming schemes and the \(3\)-class association schemes attached to symmetric designs, and regular pairwise balanced designs with block sizes three and four. Mathematics Subject Classifications: 05B05, 05C50, 05E30 Keywords: \(t\)-design, characteristic polynomial, weighing matrix, Hadamard matrix, association scheme

Combinatorial TheoryVol. 6(2)
Ministry of Education, India, Japan Society for the Promotion of Science
Openalex Percentile: Top 100%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.