MétaCan
Menu
Back to cohort
Record W1521513823 · doi:10.37236/1133

Cycle Lengths in a Permutation are Typically Poisson

2006· article· en· W1521513823 on OpenAlexaff
Andrew Granville

Bibliographic record

VenueThe Electronic Journal of Combinatorics · 2006
Typearticle
Languageen
FieldMathematics
TopicAdvanced Mathematical Identities
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsMathematicsPermutation (music)CombinatoricsPoisson distributionSet (abstract data type)Order (exchange)Parity of a permutationPrime (order theory)Permutation groupDiscrete mathematicsCyclic permutationSymmetric groupStatisticsComputer science

Abstract

fetched live from OpenAlex

The set of cycle lengths of almost all permutations in $S_n$ are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the permutation. The formulas we develop allow us to also show that almost all permutations with a given number of cycles have a certain "normal order" (in the spirit of the Erdős-Turán theorem). Our results were inspired by analogous questions about the size of the prime divisors of "typical" integers.

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.012
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: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

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

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.010
GPT teacher head0.278
Teacher spread0.268 · 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

Citations24
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueThe Electronic Journal of CombinatoricsSame topicAdvanced Mathematical IdentitiesFrench-language works237,207