MétaCan
Menu
Back to cohort
Record W2074300802 · doi:10.1002/jcd.1017

Bounds on the number of Hadamard designs of even order

2001· article· en· W2074300802 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Combinatorial Designs · 2001
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsMathematicsHadamard transformCombinatoricsUpper and lower boundsOrder (exchange)Hadamard matrixHadamard's maximal determinant problemPrime (order theory)Hadamard's inequalityDiscrete mathematics

Abstract

fetched live from OpenAlex

Abstract A new lower bound on the number of non‐isomorphic Hadamard symmetric designs of even order is proved. The new bound improves the bound on the number of Hadamard designs of order 2 n given in [12] by a factor of 8 n − 1 for every odd n > 1, and for every even n such that 4 n − 1 > 7 is a prime. For orders 8, 10, and 12, the number of non‐isomorphic Hadamard designs is shown to be at least 22,478,260, 1.31 × 10 15 , and 10 27 , respectively. For orders 2 n = 14, 16, 18 and 20, a lower bound of (4 n − 1)! is proved. It is conjectured that (4 n − 1)! is a lower bound for all orders 2 n ≥ 14. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 363‐378, 2001

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.133
Threshold uncertainty score0.448

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.026
GPT teacher head0.247
Teacher spread0.221 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it