MétaCan
Menu
Back to cohort
Record W2951330406 · doi:10.48550/arxiv.1408.5169

Constructions of complex equiangular lines from mutually unbiased bases

2014· preprint· en· W2951330406 on OpenAlexaff
Jonathan Jedwab, Amy Wiebe

Bibliographic record

VenuearXiv (Cornell University) · 2014
Typepreprint
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsEquiangular polygonCombinatoricsConjectureMutually unbiased basesMathematicsHermitian matrixSet (abstract data type)Discrete mathematicsGeometryComputer sciencePure mathematicsHilbert space

Abstract

fetched live from OpenAlex

A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the Hermitian inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is conjectured that sets of this maximum size exist in $\mathbb{C}^d$ for every $d \geq 2$. We take a combinatorial approach to this conjecture, using mutually unbiased bases (MUBs) in the following 3 constructions of equiangular lines: (1) adapting a set of $d$ MUBs in $\mathbb{C}^d$ to obtain $d^2$ equiangular lines in $\mathbb{C}^d$, (2) using a set of $d$ MUBs in $\mathbb{C}^d$ to build $(2d)^2$ equiangular lines in $\mathbb{C}^{2d}$, (3) combining two copies of a set of $d$ MUBs in $\mathbb{C}^d$ to build $(2d)^2$ equiangular lines in $\mathbb{C}^{2d}$. For each construction, we give the dimensions $d$ for which we currently know that the construction produces a maximum-sized set of equiangular lines.

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.002
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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

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

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.094
GPT teacher head0.190
Teacher spread0.096 · 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
GenreEmpirical

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

Citations2
Published2014
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicCoding theory and cryptographyFrench-language works237,207