MétaCan
Menu
Back to cohort
Record W4402616002 · doi:10.1017/s0963548324000233

A new formula for the determinant and bounds on its tensor and Waring ranks

2024· article· en· W4402616002 on OpenAlexafffund
Robin Houston, Adam P. Goucher, Nathaniel Johnston

Bibliographic record

VenueCombinatorics Probability Computing · 2024
Typearticle
Languageen
FieldMathematics
TopicTensor decomposition and applications
Canadian institutionsMount Allison University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTensor (intrinsic definition)MathematicsMathematical economicsAlgebra over a fieldPure mathematicsStatistics

Abstract

fetched live from OpenAlex

Abstract We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor is no larger than the $n$ -th Bell number, which is much smaller than the previously best-known upper bounds when $n \geq 4$ . Over fields of non-zero characteristic we obtain even tighter upper bounds, and we also slightly improve the known lower bounds. In particular, we show that the $4 \times 4$ determinant over ${\mathbb{F}}_2$ has tensor rank exactly equal to $12$ . Our results also improve upon the best-known upper bound for the Waring rank of the determinant when $n \geq 17$ , and lead to a new family of axis-aligned polytopes that tile ${\mathbb{R}}^n$ .

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.002
metaresearch head score (Gemma)0.009
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.016
Threshold uncertainty score0.052

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0020.004
Scholarly communication0.0030.010
Open science0.0020.003
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0160.003

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.087
GPT teacher head0.350
Teacher spread0.263 · 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

Citations4
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueCombinatorics Probability ComputingSame topicTensor decomposition and applicationsFrench-language works237,207