MétaCan
Menu
Back to cohort
Record W6989647975

Boolean complementary pairs

2023· dissertation· en· W6989647975 on OpenAlexaff

Bibliographic record

VenueMspace (University of Manitoba) · 2023
Typedissertation
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsHadamard transformBinary Golay codeFactorizationGeneralizationZero (linguistics)Boolean functionTernary operationComplementary sequencesTernary Golay codeConnection (principal bundle)
DOInot available

Abstract

fetched live from OpenAlex

Golay pairs (GPs) are pairs of (1,-1)-sequences with zero autocorrelation. GPs have numerous applications in engineering and mathematics such as in device synchronization, spectroscopy, and in the construction of Hadamard matrices. As a result, there is significant interest in understanding their mathematical structure. However, the structure of GPs appears to be very mysterious. Ternary complementary pairs (TCPs)—a generalization of GPs—are pairs of (0,1,-1)-sequences with zero autocorrelation. Similar to GPs, the structure of TCPs appears to be quite challenging. In order to gain insight into TCPs and GPs, Craigen introduced Boolean complementary pairs (BCPs), which are pairs of Z_2-sequences with zero autocorrelation. Craigen solved the structure of even-weight BCPs and with Woodford discovered a factorization involving 2x2 matrices in the odd-weight case. A review of Golay pairs, ternary complementary pairs, and Boolean complementary pairs is given. The odd-weight BCP factorization is extended to all pairs of Z_2-sequences with zero autocorrelation. Consequences of this extension are then established, including a connection to affixes.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation 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: Other · Consensus signal: Other
Teacher disagreement score0.025
Threshold uncertainty score0.085

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.003
Scholarly communication0.0030.004
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0250.007

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.013
GPT teacher head0.186
Teacher spread0.173 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreOther

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueMspace (University of Manitoba)Same topicgraph theory and CDMA systemsFrench-language works237,207