pith. sign in

arxiv: 2605.16722 · v1 · pith:EAZBTXERnew · submitted 2026-05-16 · 🧮 math.CO

Hadamard Hypercubes

Amin Bahmanian , Sho Suda This is my paper

Pith reviewed 2026-05-19 21:40 UTC · model grok-4.3

classification 🧮 math.CO
keywords Hadamard hypercubesconference matricesLatin hypercubesrecursive constructionssymmetric designsassociation schemescombinatorial designs
0
0 comments X

The pith

Two constructions produce Hadamard hypercubes from conference matrices and from recursive merges with Latin hypercubes.

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

Hadamard hypercubes generalize the balance and orthogonality of classical Hadamard matrices to arrays with more than two indices. One construction starts with conference matrices and applies association schemes on triples to fill the higher-dimensional array. The second construction assembles larger hypercubes by recursively combining smaller Hadamard matrices or hypercubes with Latin hypercubes. If the constructions succeed they supply explicit families of these objects and open a route to higher-dimensional symmetric designs. The work focuses on showing that the required multi-way orthogonality conditions hold in both cases.

Core claim

The paper introduces two constructions of Hadamard hypercubes. The first is derived from conference matrices and draws on the theory of association schemes on triples. The second is recursive, combining Hadamard matrices and hypercubes of smaller order with Latin hypercubes. The latter also yields applications to the construction of higher-dimensional symmetric designs.

What carries the argument

Hadamard hypercubes, higher-dimensional arrays required to satisfy multi-index orthogonality or balance conditions, built either directly from conference matrices via association schemes on triples or by recursive combination that preserves those conditions.

Load-bearing premise

The constructions preserve the higher-dimensional orthogonality and balance conditions when the smaller objects are combined with Latin hypercubes.

What would settle it

For a small order such as 4 or 6, compute the entries of one constructed hypercube and check whether every collection of fixed indices in all but two positions yields an ordinary Hadamard matrix or zero inner product as required.

read the original abstract

Although Hadamard matrices have been investigated since the nineteenth century, relatively little is known about their higher-dimensional analogues. In this paper, we introduce two constructions of Hadamard hypercubes. The first construction is derived from conference matrices, while the second is recursive, combining Hadamard matrices (and hypercubes) of smaller order with Latin hypercubes. The former approach draws on the theory of association schemes on triples, whereas the latter yields applications to the construction of higher-dimensional symmetric designs.

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 introduces two constructions of Hadamard hypercubes. The first derives from conference matrices via association schemes on triples. The second is recursive, combining Hadamard matrices or hypercubes of smaller order with Latin hypercubes, and is claimed to produce objects satisfying higher-dimensional orthogonality conditions with applications to symmetric designs.

Significance. If the constructions are shown to preserve the required multi-dimensional balance and orthogonality properties, the work would add concrete methods to the limited literature on higher-dimensional Hadamard analogues. The recursive approach could support inductive generation of larger examples, while the conference-matrix route ties into existing association-scheme machinery; both could yield new symmetric designs.

major comments (2)
  1. [Recursive construction] Recursive construction: the central claim that combining smaller-order Hadamard matrices/hypercubes with Latin hypercubes preserves higher-dimensional orthogonality (multi-way inner products or slice balance) lacks an explicit verification step or small-order exhaustive check. The interaction between the ±1 entries and the Latin symbols must be shown not to produce non-orthogonal 2-flats or higher slices; without this argument the recursive construction remains unverified.
  2. [Conference-matrix construction] Conference-matrix construction: while the link to association schemes on triples is noted, the manuscript should supply the explicit mapping from conference-matrix entries to hypercube entries together with a direct verification that the resulting object meets the Hadamard-hypercube orthogonality definition in all dimensions.
minor comments (2)
  1. [Introduction] A concise definition or list of the precise orthogonality conditions required of a Hadamard hypercube should appear early (e.g., in the introduction) rather than being assumed from context.
  2. Notation for the order and dimension parameters is introduced gradually; a single table or paragraph collecting the conventions would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable suggestions. We address the major comments below and plan to incorporate revisions to enhance the clarity and completeness of our constructions.

read point-by-point responses

  1. Referee: [Recursive construction] Recursive construction: the central claim that combining smaller-order Hadamard matrices/hypercubes with Latin hypercubes preserves higher-dimensional orthogonality (multi-way inner products or slice balance) lacks an explicit verification step or small-order exhaustive check. The interaction between the ±1 entries and the Latin symbols must be shown not to produce non-orthogonal 2-flats or higher slices; without this argument the recursive construction remains unverified.

    Authors: We agree that an explicit verification would strengthen the recursive construction. In the revised version, we will add a detailed argument showing that the combination preserves the required multi-dimensional orthogonality properties. This will include an analysis of the inner products and slice balances, along with a small-order exhaustive verification for the base cases to illustrate the absence of non-orthogonal flats. revision: yes

  2. Referee: [Conference-matrix construction] Conference-matrix construction: while the link to association schemes on triples is noted, the manuscript should supply the explicit mapping from conference-matrix entries to hypercube entries together with a direct verification that the resulting object meets the Hadamard-hypercube orthogonality definition in all dimensions.

    Authors: We will provide the explicit mapping from the conference matrix entries to the entries of the Hadamard hypercube in the revised manuscript. Additionally, we will include a direct verification of the orthogonality conditions across all dimensions, building upon the association scheme framework already referenced in the paper. revision: yes

Circularity Check

0 steps flagged

Constructions from conference matrices and Latin hypercubes show no self-referential reduction

full rationale

The paper defines Hadamard hypercubes via two explicit constructions: one derived from conference matrices (drawing on association schemes on triples) and a recursive construction that combines smaller-order Hadamard matrices/hypercubes with Latin hypercubes. These steps invoke established external combinatorial objects rather than defining the target properties in terms of themselves. No equations reduce a claimed prediction or uniqueness result to a fitted parameter or prior self-citation that itself lacks independent verification. The recursive preservation of multi-dimensional orthogonality is a standard inductive claim on known objects, not a circular renaming or self-definition. The derivation remains self-contained against external benchmarks such as the theory of conference matrices and Latin hypercubes.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The paper relies on standard combinatorial objects and assumptions from prior literature while introducing the new concept of Hadamard hypercubes; no free parameters are evident from the abstract.

axioms (2)
  • domain assumption Conference matrices of appropriate orders exist and satisfy the necessary pairwise balance properties
    Invoked for the first construction derived from conference matrices.
  • domain assumption Latin hypercubes can be combined recursively with smaller Hadamard objects while preserving required balance conditions
    Central to the recursive construction described in the abstract.
invented entities (1)
  • Hadamard hypercube no independent evidence
    purpose: Higher-dimensional analogue of a Hadamard matrix with analogous orthogonality properties
    The paper defines and constructs this as the primary new object of study.

pith-pipeline@v0.9.0 · 5594 in / 1446 out tokens · 68960 ms · 2026-05-19T21:40:42.261773+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

46 extracted references · 46 canonical work pages · 1 internal anchor

  1. [1]

    Symmetric layer-rainbow colorations of cubes.SIAM J

    Amin Bahmanian. Symmetric layer-rainbow colorations of cubes.SIAM J. Discrete Math., 37(4):2617–2625, 2023

    work page 2023

  2. [2]

    A review and new symmetric conference matrices.University of Wollongong

    N A Balonin and Jennifer Seberry. A review and new symmetric conference matrices.University of Wollongong. Journal contribution, 2014

    work page 2014

  3. [3]

    Benjamin/Cummings Publishing Company, California, 1984

    Eiichi Bannai and Tatsuro Ito.Algebraic Combinatorics I: Association Schemes. Benjamin/Cummings Publishing Company, California, 1984

    work page 1984

  4. [4]

    The edge-coloring of complete hypergraphs

    Zsolt Baranyai. The edge-coloring of complete hypergraphs. I.J. Combin. Theory Ser. B, 26(3):276–294, 1979

    work page 1979

  5. [5]

    Brouwer and Willem H

    Andries E. Brouwer and Willem H. Haemers.Spectra of graphs. Universitext. Springer, New York, 2012

    work page 2012

  6. [6]

    Peter J. Cameron. Cohomological aspects of two-graphs.Math. Z., 157(2):101–119, 1977

    work page 1977

  7. [7]

    Complex hadamard matrices and strongly regular graphs

    Ada Chan. Complex hadamard matrices and strongly regular graphs. Preprint, arXiv:1102.5601, 2011

    work page arXiv 2011

  8. [8]

    Complex hadamard matrices, instantaneous uniform mixing and cubes.Algebraic Combinatorics, 3(3):757–774, 2020

    Ada Chan. Complex hadamard matrices, instantaneous uniform mixing and cubes.Algebraic Combinatorics, 3(3):757–774, 2020

    work page 2020

  9. [9]

    On the construction ofn-dimensional designs from 2-dimensional designs

    Warwick de Launey. On the construction ofn-dimensional designs from 2-dimensional designs. volume 1, pages 67–81. 1990. Combinatorial mathematics and combinatorial computing, Vol. 1 (Brisbane, 1989)

    work page 1990

  10. [10]

    Delsarte, J.-M

    P. Delsarte, J.-M. Goethals, and J. J. Seidel. Orthogonal matrices with zero diagonal. II.Canadian J. Math., 23:816–832, 1971

    work page 1971

  11. [11]

    Stephen A. Dyer. Hadamard transform spectrometry.Chemometrics and Intelligent Laboratory Systems, 12:101– 115, 1991

    work page 1991

  12. [12]

    Ethier, Gary L

    John T. Ethier, Gary L. Mullen, Daniel Panario, Brett Stevens, and David Thomson. Sets of orthogonal hyper- cubes of classr.J. Combin. Theory Ser. A, 119(2):430–439, 2012

    work page 2012

  13. [13]

    On a class of quaternary complex Hadamard matrices.Discrete Mathematics, 341(2):421–426, 2018

    Kai Fender, Hadi Kharaghani, and Sho Suda. On a class of quaternary complex Hadamard matrices.Discrete Mathematics, 341(2):421–426, 2018

    work page 2018

  14. [14]

    Goethals and J

    J.-M. Goethals and J. J. Seidel. Strongly regular graphs derived from combinatorial designs.Canadian J. Math., 22:597–614, 1970

    work page 1970

  15. [15]

    Goldbach and H.L

    R.W. Goldbach and H.L. Claasen. 3-class association schemes and hadamard matrices of a certain block form. European Journal of Combinatorics, 19(8):943–951, 1998

    work page 1998

  16. [16]

    Constructions of $t$-designs from weighing matrices and association schemes

    Gary Greaves and Sho Suda. Constructions oft-designs from weighing matrices and association schemes.arXiv preprint arXiv:2402.17528, 2024

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  17. [17]

    Hadamard

    J. Hadamard. R´ esolution d’une question relative aux d´ eterminants.Bulletin des Sciences Math´ ematiques, 17:240– 246, 1893

    work page

  18. [18]

    Higher-dimensional orthogonal designs and Hadamard matrices

    Joseph Hammer and Jennifer Seberry. Higher-dimensional orthogonal designs and Hadamard matrices. II. In Proceedings of the Ninth Manitoba Conference on Numerical Mathematics and Computing (Univ. Manitoba, Winnipeg, Man., 1979), volume XXVII ofCongress. Numer., pages 23–29. Utilitas Math., Winnipeg, MB, 1980. 24

    work page 1979

  19. [19]

    Hedayat and W

    A. Hedayat and W. D. Wallis. Hadamard matrices and their applications.Ann. Statist., 6(6):1184–1238, 1978

    work page 1978

  20. [20]

    Huggan, G

    M. Huggan, G. L. Mullen, B. Stevens, and D. Thomson. Sudoku-like arrays, codes and orthogonality.Des. Codes Cryptogr., 82(3):675–693, 2017

    work page 2017

  21. [21]

    Complex Hadamard matrices contained in a Bose–Mesner algebra.Special Matrices, 3(1):91–110, 2015

    Takuya Ikuta and Akihiro Munemasa. Complex Hadamard matrices contained in a Bose–Mesner algebra.Special Matrices, 3(1):91–110, 2015

    work page 2015

  22. [22]

    Butson-type complex Hadamard matrices and association schemes on Galois rings of characteristic 4.Special Matrices, 6(1):1–10, 2018

    Takuya Ikuta and Akihiro Munemasa. Butson-type complex Hadamard matrices and association schemes on Galois rings of characteristic 4.Special Matrices, 6(1):1–10, 2018

    work page 2018

  23. [23]

    Complex Hadamard Matrices Attached to a 3-Class Nonsymmetric As- sociation Scheme.Graphs and Combinatorics, 35(6):1293–1304, 2019

    Takuya Ikuta and Akihiro Munemasa. Complex Hadamard Matrices Attached to a 3-Class Nonsymmetric As- sociation Scheme.Graphs and Combinatorics, 35(6):1293–1304, 2019

    work page 2019

  24. [24]

    Ionin and Mohan S

    Yury J. Ionin and Mohan S. Shrikhande.Combinatorics of symmetric designs, volume 5 ofNew Mathematical Monographs. Cambridge University Press, Cambridge, 2006

    work page 2006

  25. [25]

    Kharaghani

    H. Kharaghani. New class of weighing matrices.Ars Combin., 19:69–72, 1985

    work page 1985

  26. [26]

    Symmetric bush-type generalized hadamard matrices and association schemes

    Hadi Kharaghani and Sho Suda. Symmetric bush-type generalized hadamard matrices and association schemes. Finite Fields and Their Applications, 37:72–84, 2016

    work page 2016

  27. [27]

    K. Kishen. On the construction of latin and hyper-graeco-latin cubes and hypercubes.J. Indian Soc. Agric. Statist., 2:20–48, 1949

    work page 1949

  28. [28]

    Three-dimensional Hadamard matrices of Paley type.Finite Fields Appl., 92:Paper No

    Vedran Krˇ cadinac, Mario Osvin Pavˇ cevi´ c, and Kristijan Tabak. Three-dimensional Hadamard matrices of Paley type.Finite Fields Appl., 92:Paper No. 102306, 6, 2023

    work page 2023

  29. [29]

    Cubes of symmetric designs.Ars Math

    Vedran Krˇ cadinac, Mario Osvin Pavˇ cevi´ c, and Kristijan Tabak. Cubes of symmetric designs.Ars Math. Con- temp., 25(1):Paper No. 10, 16, 2025

    work page 2025

  30. [30]

    Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications.Discrete Appl

    Vedran Krˇ cadinac, Shenggui Zhang, Liming Xiong, and Dragan Stevanovi´ c. Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications.Discrete Appl. Math., 371:99– 104, 2025. Held at Serbian Academy of Sciences and Arts in Belgrade, June 9–14, 2024

    work page 2025

  31. [31]

    On higher-dimensional symmetric designs.Experimental Mathe- matics, 0(0):1–14, 2025

    Vedran Krˇ cadinac and Mario Osvin Pavˇ cevi´ c. On higher-dimensional symmetric designs.Experimental Mathe- matics, 0(0):1–14, 2025

    work page 2025

  32. [32]

    Mesner and Prabir Bhattacharya

    Dale M. Mesner and Prabir Bhattacharya. Association schemes on triples and a ternary algebra.J. Combin. Theory Ser. A, 55(2):204–234, 1990

    work page 1990

  33. [33]

    Mesner and Prabir Bhattacharya

    Dale M. Mesner and Prabir Bhattacharya. A ternary algebra arising from association schemes on triples.J. Algebra, 164(3):595–613, 1994

    work page 1994

  34. [34]

    Eric Moorhouse

    G. Eric Moorhouse. Two-graphs and skew two-graphs in finite geometries.Linear Algebra Appl., 226/228:529– 551, 1995

    work page 1995

  35. [35]

    R. E. A. C. Paley. On orthogonal matrices.J. Math. and Physics, 12:311–320, 1933

    work page 1933

  36. [36]

    Doubly regular tournaments are equivalent to skew hadamard matrices

    Kenneth B Reid and Ezra Brown. Doubly regular tournaments are equivalent to skew hadamard matrices. Journal of Combinatorial Theory, Series A, 12(3):332–338, 1972

    work page 1972

  37. [37]

    Higher-dimensional orthogonal designs and Hadamard matrices

    Jennifer Seberry. Higher-dimensional orthogonal designs and Hadamard matrices. InCombinatorial mathematics, VII (Proc. Seventh Australian Conf., Univ. Newcastle, Newcastle, 1979), volume 829 ofLecture Notes in Math., pages 220–223. Springer, Berlin, 1980

    work page 1979

  38. [38]

    Hadamard matrices, sequences, and block designs

    Jennifer Seberry and Mieko Yamada. Hadamard matrices, sequences, and block designs. InContemporary design theory, Wiley-Intersci. Ser. Discrete Math. Optim., pages 431–560. Wiley, New York, 1992

    work page 1992

  39. [39]

    Shlichta

    Paul J. Shlichta. Higher dimensional Hadamard matrices.IEEE Trans. Inform. Theory, 25(5):566–572, 1979

    work page 1979

  40. [40]

    Sylvester

    J.J. Sylvester. Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colours, with applications to newton’s rule, ornamental tile-work, and the theory of numbers. Philosophical Magazine, 34:461–475, 1867

    work page

  41. [41]

    D. E. Taylor. Regular 2-graphs.Proc. London Math. Soc. (3), 35(2):257–274, 1977

    work page 1977

  42. [42]

    J. H. van Lint and R. M. Wilson.A course in combinatorics. Cambridge University Press, Cambridge, second edition, 2001

    work page 2001

  43. [43]

    J. E. Whelchel and D. F. Guinn. The fast fourier-hadamard transform and its use in signal representation and classification.EASCON ’68 Convention Record, published by the I E E E Transactions on Aerospace and Electronic Systems, pages 561–573, 1968

    work page 1968

  44. [44]

    Hadamard’s determinant theorem and the sum of four squares.Duke Math

    John Williamson. Hadamard’s determinant theorem and the sum of four squares.Duke Math. J., 11:65–81, 1944

    work page 1944

  45. [45]

    Chapman & Hall/CRC, Boca Raton, FL, USA, 2nd edition, 2010

    Yang Yi Xian, Xin Xin Niu, and Cheng Qing Xu.Theory and Applications of Higher-Dimensional Hadamard Matrices. Chapman & Hall/CRC, Boca Raton, FL, USA, 2nd edition, 2010. Includes additional applications and updated constructions

    work page 2010

  46. [46]

    Y.X. Yang. Proofs of some conjectures about higher-dimensional hadamard matrices.Kexue Tong- bao, 31(2):85– 88, 1986. Department of Mathematics, Illinois State University, Normal, IL USA 61790-4520 Department of Mathematics, National Defense Academy of Japan, 239-8686 Japan

    work page 1986