pith. sign in

arxiv: 2402.17528 · v2 · submitted 2024-02-27 · 🧮 math.CO

Constructions of t-designs from weighing matrices and association schemes

Gary Greaves , Sho Suda This is my paper

Pith reviewed 2026-05-24 03:44 UTC · model grok-4.3

classification 🧮 math.CO
keywords t-designsweighing matricesassociation schemesconference matricesPBIBDpairwise balanced designsHamming schemes
0
0 comments X

The pith

A method constructs t-designs from weighing matrices and association schemes, including 3-designs from any conference matrix.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The authors develop a technique to build t-designs by combining weighing matrices with association schemes. One application of the method produces a 3-design from every symmetric or skew-symmetric conference matrix, which partially resolves a question from 2017. Variations on the method also generate infinite families of partially balanced incomplete block designs with block size four on binary Hamming schemes and on 3-class schemes coming from symmetric designs, together with regular pairwise balanced designs having block sizes three and four. A reader cares because the work supplies explicit new combinatorial objects by linking two standard matrix constructions to balanced designs.

Core claim

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.

What carries the argument

The general construction that defines points and blocks from the entries of a weighing matrix together with the relations of an association scheme so that the resulting incidence structure meets the t-design balance equations.

If this is right

  • Every symmetric or skew-symmetric conference matrix yields at least one 3-design.
  • Infinite families of PBIBDs with block size four exist on every binary Hamming scheme.
  • Infinite families of PBIBDs with block size four exist on the 3-class schemes attached to symmetric designs.
  • Regular pairwise balanced designs with block sizes three and four arise in infinite families from the restricted-matrix variations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same matrix-to-design map might be applied to other families such as Hadamard matrices to produce further designs.
  • One could test whether the new designs inherit transitivity or other symmetry properties from the input schemes.
  • The parameter formulas might be used to search for designs whose block size or replication number was previously unknown.
  • The construction supplies a systematic way to turn existence questions about conference matrices into existence questions about 3-designs.

Load-bearing premise

The input weighing matrices or association schemes must obey the listed combinatorial restrictions that force the derived design parameters to be non-negative integers.

What would settle it

Take any explicit symmetric conference matrix of order 26; compute the block collection produced by the construction and check whether every triple of points lies in exactly the predicted constant number of blocks.

Figures

Figures reproduced from arXiv: 2402.17528 by Gary Greaves, Sho Suda.

Figure 1
Figure 1. Figure 1: The matrix H from Section 4.3. Example 4.3. The matrix G is a n ±1, ± √ −1, ± 1 2 , ± √ −1 2 , 0 o -matrix, and DG(3) =  0, 1 4 , 1 2 , 1  . Let α0 = 1, α1 = 1 2 , α2 = 0, α3 = − 1 2 , α4 = −1, α5 = √ −1, α6 = − √ −1, α7 = √ −1 2 , α8 = − √ −1 2 , define 80 × 80 disjoint {0, 1}-matrices Ai for i ∈ {0, 1, . . . , 6} by G = P8 i=0 αiAi and P8 i=0 Ai = J. It is shown in [41] that the set of matrices {A0, A1… view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript presents a general method for constructing t-designs from weighing matrices and association schemes. A key instance is claimed to yield a 3-(v,k,λ) design from any symmetric or skew-symmetric conference matrix of admissible order, providing a partial answer to a question of Gunderson and Semeraro (JCTB 2017). The authors also derive infinite families of partially balanced incomplete block designs (PBIBDs) with block size 4 from the binary Hamming schemes and from 3-class association schemes attached to symmetric designs, together with regular pairwise balanced designs (PBDs) having block sizes 3 and 4, all under stated combinatorial restrictions on the input objects.

Significance. If the parameter integrality and non-negativity conditions hold for the stated families, the work supplies explicit, infinite constructions of designs with small block sizes from well-studied combinatorial objects; the partial resolution of the Gunderson–Semeraro question would be a concrete contribution to the literature on 3-designs.

major comments (2)
  1. [Abstract and conference-matrix construction] Abstract and the conference-matrix construction (presumably §3): the claim that the method produces a 3-design from any symmetric or skew-symmetric conference matrix is not accompanied by an explicit verification that λ is an integer for every admissible order n (n ≡ 0 or 2 mod 4). The text restricts attention to matrices satisfying “certain combinatorial restrictions,” which leaves open whether the general statement holds or whether additional divisibility conditions are required; a direct computation of the resulting λ expression for the known small orders (n=6,10,14,…) is needed to substantiate the claim.
  2. [Hamming and symmetric-design constructions] The PBIBD constructions on Hamming schemes and symmetric-design schemes (presumably §4–5): while infinite families are asserted, the manuscript must exhibit the precise parameter sets (v,b,r,k,λ_i) and confirm that the block-size-4 condition is satisfied uniformly for all members of each family; without these explicit formulas or a table of the first few members, the “various infinite families” claim cannot be checked for consistency with the association-scheme parameters.
minor comments (2)
  1. [Preliminaries] Notation for the weighing-matrix inner-product relations and the resulting design parameters should be introduced once and used consistently; several passages repeat the same matrix equation without cross-reference.
  2. [References] The reference list omits at least two standard texts on association schemes (e.g., Bannai–Ito or Godsil) that would clarify the 3-class scheme parameters used in §5.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major point below and have revised the paper accordingly to strengthen the presentation and verifiability of the constructions.

read point-by-point responses

  1. Referee: [Abstract and conference-matrix construction] Abstract and the conference-matrix construction (presumably §3): the claim that the method produces a 3-design from any symmetric or skew-symmetric conference matrix is not accompanied by an explicit verification that λ is an integer for every admissible order n (n ≡ 0 or 2 mod 4). The text restricts attention to matrices satisfying “certain combinatorial restrictions,” which leaves open whether the general statement holds or whether additional divisibility conditions are required; a direct computation of the resulting λ expression for the known small orders (n=6,10,14,…) is needed to substantiate the claim.

    Authors: We agree that explicit verification is needed. The construction yields a 3-(v,k,λ) design precisely when the derived λ is a non-negative integer; this holds for conference matrices satisfying the stated combinatorial restrictions, but the abstract phrasing 'from any' should be qualified. In the revision we add the explicit λ formula in terms of the conference matrix order n, compute λ directly for all admissible orders up to n=26 (including n=6,10,14,18,22,26), and confirm integrality under the restrictions. We also clarify in §3 that the general statement applies only when these integrality conditions are met. revision: yes

  2. Referee: [Hamming and symmetric-design constructions] The PBIBD constructions on Hamming schemes and symmetric-design schemes (presumably §4–5): while infinite families are asserted, the manuscript must exhibit the precise parameter sets (v,b,r,k,λ_i) and confirm that the block-size-4 condition is satisfied uniformly for all members of each family; without these explicit formulas or a table of the first few members, the “various infinite families” claim cannot be checked for consistency with the association-scheme parameters.

    Authors: We accept this point. The revised manuscript now includes closed-form expressions for the full parameter tuple (v,b,r,k,λ_1,λ_2,λ_3) of each PBIBD family, expressed directly in terms of the underlying association-scheme parameters. We also add a table displaying the numerical parameters for the first five members of each infinite family (binary Hamming schemes of dimension d=3,4,… and the 3-class schemes from symmetric designs of order m=4,5,…), confirming that k=4 holds uniformly and that all parameters remain integral and non-negative. revision: yes

Circularity Check

0 steps flagged

No circularity: constructions derive designs from input matrix properties

full rationale

The paper presents explicit constructions of t-designs from weighing matrices and association schemes, with the central instance deriving 3-design parameters from the inner-product relations of conference matrices (e.g., CC^T properties). No step reduces a claimed prediction or uniqueness result to a fitted input, self-definition, or self-citation chain; the derivation computes incidence structures and verifies integrality/non-negativity directly from the given combinatorial objects under stated restrictions. External citations (Gunderson-Semeraro) are to unrelated prior questions and do not bear the load of the construction. The work is self-contained as a source of new designs rather than a renaming or re-derivation of its inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no free parameters, new axioms, or invented entities are described. The work relies on standard combinatorial objects (weighing matrices, conference matrices, association schemes) whose existence is presupposed from prior literature.

pith-pipeline@v0.9.0 · 5629 in / 1158 out tokens · 25291 ms · 2026-05-24T03:44:32.420575+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Hadamard Hypercubes

    math.CO 2026-05 unverdicted novelty 6.0

    The authors present two constructions of Hadamard hypercubes: one derived from conference matrices using association schemes on triples, and a recursive construction combining smaller Hadamard matrices or hypercubes w...

Reference graph

Works this paper leans on

47 extracted references · 47 canonical work pages · cited by 1 Pith paper · 1 internal anchor

  1. [1]

    Akiyama, M

    K. Akiyama, M. Ogawa, and C. Suetake, On ST D6[18; 3]’s and STD7[21; 3]’s admitting a semiregular automorphism group of order 9 , Electron. J. Combin. 16, #R148, (2009)

    work page 2009

  2. [2]

    Assmus Jr

    E.F. Assmus Jr. and H.F. Mattson Jr., New 5-designs, J. Comb. Theory 6, 122–151 (1969)

    work page 1969

  3. [3]

    Ball, Finite geometry and combinatorial application s, volume82

    S. Ball, Finite geometry and combinatorial application s, volume82. Cambridge University Press, 2015

    work page 2015

  4. [4]

    Balonin, J

    N.A. Balonin, J. Seberry, A review and new symmetric conf erence matrices, Informatsionno- upravliaiushchie sistemy, 71 (4), 2–7 (2014)

    work page 2014

  5. [5]

    Belkouche, A

    W. Belkouche, A. Boussa ¨ ıri, S. Lakhlfi, and M. Zaidi, Matricial characterization of tourna- ments with maximum number of diamonds , Discrete Math. 343(4), 111699, (2020). 28

    work page 2020

  6. [6]

    Bose and K.R

    R.C. Bose and K.R. Nair, Partially balanced incomplete block designs , Sankhya, 4, 337–372 (1939)

    work page 1939

  7. [7]

    Boussa ¨ ıri, I

    A. Boussa ¨ ıri, I. Souktani, I. Talbaoui, and M. Zouagui,k-spectrally monomorphic tournaments, Discrete Math. 345(5), 112804 (2022)

    work page 2022

  8. [8]

    Brouwer, Regular symmetric Hadamard matrices with constant diagona l, preprint (2016)

    A.E. Brouwer, Regular symmetric Hadamard matrices with constant diagona l, preprint (2016)

    work page 2016

  9. [9]

    Brouwer, A.M

    A.E. Brouwer, A.M. Cohen and A. Neumaier, Distance-Regu lar Graphs, Springer-Verlag, Berlin, 1989

    work page 1989

  10. [10]

    Brouwer, W.H

    A.E. Brouwer, W.H. Haemers, Spectra of Graphs, Springe r New York, NY, 2012

    work page 2012

  11. [11]

    Brouwer and H

    A.E. Brouwer and H. Van Maldeghem, Strongly Regular Gra phs, Cambridge University Press, 2022

    work page 2022

  12. [12]

    Butson, Generalized Hadamard matrices , Proc

    A.T. Butson, Generalized Hadamard matrices , Proc. Amer. Math. Soc., 13 894–898 (1962)

    work page 1962

  13. [13]

    De Caen, The spectra of complementary subgraphs in a strongly regular graph, European J

    D. De Caen, The spectra of complementary subgraphs in a strongly regular graph, European J. Combin. 19, 559–565, (1998)

    work page 1998

  14. [14]

    van Dam, J.H

    E.R. van Dam, J.H. Koolen, and H. Tanaka, Distance-regu lar graphs, Electr. J. Combin. #DS22 (2016)

    work page 2016

  15. [15]

    Delsarte, J.-M

    P. Delsarte, J.-M. Goethals, and J. J. Seidel, Spherical codes and designs , Geom. Dedicata, 6, 363–388 (1977)

    work page 1977

  16. [16]

    Tables of the existence of equiangular tight frames

    M. Fickus and D.G. Mixon, Tables of the existence of equiangular tight frames , arXiv:1504.00253 (2016)

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  17. [17]

    R.A. Fisher. An examination of the different possible solutions of a probl em in incomplete blocks, Ann. Eugenics. 10 52–75 (19409

    work page

  18. [18]

    Frankl and Z

    P. Frankl and Z. F¨ uredi, An exact result for 3-graphs , Discrete Math. 50 323–328 (1984)

    work page 1984

  19. [19]

    Gantmacher, The Theory of Matrices, Vol

    F.R. Gantmacher, The Theory of Matrices, Vol. 1, Chelse a, 1959

    work page 1959

  20. [20]

    Godsil, Algebraic Combinatorics, Chapman & Hall, 1993

    C.D. Godsil, Algebraic Combinatorics, Chapman & Hall, 1993

    work page 1993

  21. [21]

    Godsil and B.D

    C.D. Godsil and B.D. McKay, Feasibility conditions for the existence of walk-regular g raphs, Linear Algebra Appl. 30 51–61 (1980)

    work page 1980

  22. [22]

    Goldbach and H.L

    R.W. Goldbach and H.L. Claasen, The Structure of imprimitive non-symmetric 3-class asso- ciation Schemes , Europ. J. Combin., 17, 23–37 (1996)

    work page 1996

  23. [23]

    Greaves and S

    G. Greaves and S. Suda, Symmetric and Skew-Symmetric {0, ± 1}-Matrices with Large Deter- minants, J. Combin. Des. 25(11), 507–522 (2017)

    work page 2017

  24. [24]

    Greaves and C.J

    G. Greaves and C.J. Woo, Hermitian matrices of roots of unity and their characterist ic poly- nomials, J. Combin. Theory, Series A, 200, 105793 (2023)

    work page 2023

  25. [25]

    Gunderson and J

    K. Gunderson and J. Semeraro, Tournaments, 4-uniform hypergraphs, and an exact extremal result, J. Combin. Theory, Series B, 126, 114–136 (2017). 29

    work page 2017

  26. [26]

    Hoggar, Two quaternionic 4-polytopes , in The Geometric Vein, Coxeter Festschrift, Springer-Verlag, New York, 219–230 (1981)

    S.G. Hoggar, Two quaternionic 4-polytopes , in The Geometric Vein, Coxeter Festschrift, Springer-Verlag, New York, 219–230 (1981)

    work page 1981

  27. [27]

    Horn and C.R

    R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1990

    work page 1990

  28. [28]

    Huang, Induced subgraphs of hypercubes and a proof of the sensitivit y conjecture, Ann

    H. Huang, Induced subgraphs of hypercubes and a proof of the sensitivit y conjecture, Ann. of Math. 190(3), 949–955 (2019)

    work page 2019

  29. [29]

    Jungnickel and H

    D. Jungnickel and H. Kharaghani. Balanced generalized weighing matrices and their applica- tions, Matematiche (Catania), 59(1-2):225–261 (2006)

    work page 2006

  30. [30]

    Kharaghani, T

    H. Kharaghani, T. Pender, and S. Suda. A family of balanced generalized weighing matrices , Combinatorica, 42, 881–894 (2022)

    work page 2022

  31. [31]

    Kharaghani and J

    H. Kharaghani and J. Seberry, Regular complex Hadamard matrices , Congr. Numerantium, 75, 187–201 (1990)

    work page 1990

  32. [32]

    Kharaghani and S

    H. Kharaghani and S. Suda, Symmetric Bush-type generalized Hadamard matrices and ass o- ciation schemes, Finite Fields Appl. 37, 72–84 (2016)

    work page 2016

  33. [33]

    Kharaghani and S

    H. Kharaghani and S. Suda, Hoffman’s coclique bound for no rmal regular digraphs, and nonsymmetric association schemes, Mathematics Across Con temporary Sciences, 137–150, Springer Proc. Math. Stat., 190, Springer, Cham, 2017

    work page 2017

  34. [34]

    Kramer, D.L

    E.S. Kramer, D.L. Kreher, t-wise balanced designs, In: Handbook of Combinatorial Desi gns, second edition, 657-663 (2007)

    work page 2007

  35. [35]

    Li and Y

    N. Li and Y. Zhu, PBIB-designs from certain subsets of distance-regular grap hs. Bull. Iran. Math. Soc. 50, 15 (2024). https://doi.org/10.1007/s41980-024-00859- y

    work page doi:10.1007/s41980-024-00859- 2024

  36. [36]

    van Lint, and J.J

    J.H. van Lint, and J.J. Seidel, Equilateral point sets i n elliptic geometry. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen: Seri es A: Mathematical Sciences, 69(3), 335–348 (1966)

    work page 1966

  37. [37]

    McKay, Combinatorial Data, http://users.cecs.anu.edu.au/~bdm/data/digraphs.html

    B. McKay, Combinatorial Data, http://users.cecs.anu.edu.au/~bdm/data/digraphs.html

    work page

  38. [38]

    Nair and C.R

    K.R. Nair and C.R. Rao, A note on partially balanced incomplete block designs , Science and Culture, 7, 568–569 (1942)

    work page 1942

  39. [39]

    Pott, Finite geometry and character theory, Lecture Notes in Mathematics, vol.1601, Springer-Verlag, Berlin (1995)

    A. Pott, Finite geometry and character theory, Lecture Notes in Mathematics, vol.1601, Springer-Verlag, Berlin (1995)

    work page 1995

  40. [40]

    Reid and E

    K.B. Reid and E. Brown, Doubly Regular Tournaments are Equivalent to Skew Hadamard Matrices, J. Combin. Theory Ser. A 12, 332–338 (1972)

    work page 1972

  41. [41]

    Roy and S

    A. Roy and S. Suda, Complex spherical designs and codes, J. Combin. Designs, 22, 105–148 (2014)

    work page 2014

  42. [42]

    Schmidt, Characters and cyclotomic fields in finite ge ometry, Lecture Notes in Mathematics, vol

    B. Schmidt, Characters and cyclotomic fields in finite ge ometry, Lecture Notes in Mathematics, vol. 1797, Springer-Verlag, Berlin, 2002

    work page 2002

  43. [43]

    Seberry, On skew Hadamard matrices , Ars

    J. Seberry, On skew Hadamard matrices , Ars. Combinatoria, 6, 255–276 (1978). 30

    work page 1978

  44. [44]

    Seberry and M

    J. Seberry and M. Yamada, Hadamard matrices: construct ions using number theory and linear algebra, Wiley (2020)

    work page 2020

  45. [45]

    Stinson, Combinatorial Designs: Constructions and Analysis, Springer-Verlag, New York, 2004

    D. Stinson, Combinatorial Designs: Constructions and Analysis, Springer-Verlag, New York, 2004

    work page 2004

  46. [46]

    Street, A.P

    D.J. Street, A.P. Street, partially balanced incomple te block designs, In: Handbook of Com- binatorial Designs, second edition, 562-565 (2007)

    work page 2007

  47. [47]

    Wootters and B.D

    W.K. Wootters and B.D. Fields, Optimal state-determination by mutually unbiased measure - ments, Ann. Physics, 191(2), 363–381, (1989). 31

    work page 1989