MétaCan
Menu
Back to cohort
Record W98729622

INTERMEDIATE AND LIMITING BEHAVIOR OF POWERS OF SOME CIRCULANT MATRICES

2008· article· en· W98729622 on OpenAlexvenueno aff
Gregory P. Tollisen, Tamás Lengyel

Bibliographic record

VenueArs Combinatoria · 2008
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsCirculant matrixAperiodic graphCombinatoricsMatrix (chemical analysis)Tensor productSequence (biology)Markov chainBinary numberDiscrete mathematicsPure mathematicsArithmetic
DOInot available

Abstract

fetched live from OpenAlex

Let A be an arbitrary circulant stochastic matrix, and let x 0 be a vector. An canonical form is derived for A k (as k !1 ) as a tensor product of three simple matrices by employing a pseudo-invariant on sections of states for a Markov process with tran- sition matrix A 0 , and by analyzing how A acts on the sections, through its auxiliary polynomial. An element-wise asymptotic characterization of A k is also given, generalizing previous results to cover both periodic and aperiodic cases. For a particular circulant stochastic matrix, identifying the intermediate stage at which fractions first appear in the sequence xk = A k x0 is accomplished by utilizing congruential matrix identities and (0,1)-matrices to determine the minimum 2-adic order of the co- ordinates of xk through their binary expansions. Throughout, results are interpreted in the context of an arbitrary weighted average repeat- edly applied simultaneously to each term of a finite sequence when read cyclically.

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 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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.011
Threshold uncertainty score0.273

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.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.028
GPT teacher head0.277
Teacher spread0.249 · 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 teacher head, 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
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueArs CombinatoriaSame topicGraph theory and applicationsFrench-language works237,207