Constructions of \(t\)-designs from weighing matrices and association schemes
Combinatorial Theory · 20.08.2026 · 6 (2)
DOI: 10.5070/c6.68661 ↗Kurz gefasst
Fachartikel in der Zeitschrift Combinatorial Theory, online erschienen am 20.08.2026. Verfasst von Gary Greaves und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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
Zitieren
APA
Greaves, G., & Suda, S. (2026). Constructions of \(t\)-designs from weighing matrices and association schemes. Combinatorial Theory, 6(2). https://doi.org/10.5070/c6.68661
Vancouver
Greaves G, Suda S. Constructions of \(t\)-designs from weighing matrices and association schemes. Combinatorial Theory. 2026;6(2). doi:10.5070/c6.68661
BibTeX
@article{Greaves2026,
author = {Greaves, Gary and Suda, Sho},
title = {Constructions of \(t\)-designs from weighing matrices and association schemes},
journal = {Combinatorial Theory},
year = {2026},
volume = {6},
number = {2},
doi = {10.5070/c6.68661}
}
EUVIMED