MétaCan
Menu
Back to cohort
Record W4408968070 · doi:10.61091/ars162-14

Type B set partitions, an analogue of restricted growth functions

2025· article· en· W4408968070 on OpenAlexvenueno aff
Amrita Acharyya

Bibliographic record

VenueArs Combinatoria · 2025
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsSet (abstract data type)Type (biology)CombinatoricsArithmeticComputer scienceProgramming languageBiology

Abstract

fetched live from OpenAlex

<p> In this work, we study type B set partitions for a given specific positive integer \(k\) defined over \(\langle n \rangle = \{-n, -(n-1), \cdots, -1, 0, 1, \cdots, n-1, n\}\). We found a few generating functions of type B analogues for some of the set partition statistics defined by Wachs, White and Steingrímsson for partitions over positive integers \([n] = \{1, 2, \cdots, n\}\), both for standard and ordered set partitions respectively. We extended the idea of restricted growth functions utilized by Wachs and White for set partitions over \([n]\), in the scenario of \(\langle n \rangle\) and called the analogue as Signed Restricted Growth Function (SRGF). We discussed analogues of major index for type B partitions in terms of SRGF. We found an analogue of Foata bijection and reduced matrix for type B set partitions as done by Sagan for set partitions of \([n]\) with specific number of blocks \(k\). We conclude with some open questions regarding the type B analogue of some well known results already done in case of set partitions of \([n]\). </p>

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.001
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.012
Threshold uncertainty score0.352

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
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.032
GPT teacher head0.325
Teacher spread0.293 · 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

Citations1
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueArs CombinatoriaSame topicAdvanced Topology and Set TheoryFrench-language works237,207