MétaCan
Menu
Back to cohort
Record W3116903618 · doi:10.12697/acutm.2011.15.04

Polynomial expansions via embedded Pascal’s triangles

2011· article· en· W3116903618 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

VenueActa et Commentationes Universitatis Tartuensis de Mathematica · 2011
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsWestern University
Fundersnot available
KeywordsMonomialMathematicsPascal (unit)Symbolic computationBinomial coefficientCombinatoricsExtension (predicate logic)ComputationPolynomialRowAlgebra over a fieldPure mathematicsAlgorithmMathematical analysisComputer science

Abstract

fetched live from OpenAlex

An expansion is given for polynomials of the form (ω + λ1) · · ·(ω +λn). The coefficients of the resulting polynomials are related to their roots, and a system of equations that enables one to numericallydetermine the roots in terms of the coefficients is specified. The case where all the roots λi are equal is considered as well. A multinomial extension to polynomials of the form (x1+ · · · + xI )n is then provided. As it turns out, the coefficients of the monomials contained in the resulting polynomial expansion can be determined in terms of the coefficients of the monomials included in the expansion of (x1+ · · · + xI-1 )n and the rows of embedded Pascal’s triangles of successive orders. An algorithm is provided for generating and concatenating these rows, with the particulars of its implementation by means of the symbolic computation software Mathematica being discussed as well. Potential applications of such expansions to combinatorics and genomics are also suggested.

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.000
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: Methods · Consensus signal: Methods
Teacher disagreement score0.253
Threshold uncertainty score0.776

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.001
Open science0.0010.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.045
GPT teacher head0.281
Teacher spread0.236 · 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