MétaCan
Menu
Back to cohort
Record W2769849793 · doi:10.37236/7524

Necessary Conditions for Schur-Maximality

2018· preprint· en· W2769849793 on OpenAlexaff
Foster Tom, Stephanie van Willigenburg

Bibliographic record

VenueThe Electronic Journal of Combinatorics · 2018
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Combinatorial Mathematics
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsConjectureMathematicsRowCombinatoricsSkewOrder (exchange)PhysicsComputer science

Abstract

fetched live from OpenAlex

McNamara and Pylyavskyy conjectured precisely which connected skew shapes are maximal in the Schur-positivity order, which says that $B\leq _s A$ if $s_A-s_B$ is Schur-positive. Towards this, McNamara and van Willigenburg proved that it suffices to study equitable ribbons, namely ribbons whose row lengths are all of length $a$ or $(a+1)$ for $a\geq 2$. In this paper we confirm the conjecture of McNamara and Pylyavskyy in all cases where the comparable equitable ribbons form a chain. We also confirm a conjecture of McNamara and van Willigenburg regarding which equitable ribbons in general are minimal. Additionally, we establish two sufficient conditions for the difference of two ribbons to be Schur-positive, which manifest as diagrammatic operations on ribbons. We also deduce two necessary conditions for the difference of two equitable ribbons to be Schur-positive that rely on rows of length $a$ being at the end, or on rows of length $(a+1)$ being evenly distributed.

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: Methods · Consensus signal: none
Teacher disagreement score0.015
Threshold uncertainty score0.050

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0020.004
Scholarly communication0.0020.004
Open science0.0010.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0150.002

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.050
GPT teacher head0.366
Teacher spread0.316 · 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
GenreMethods

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

Citations0
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueThe Electronic Journal of CombinatoricsSame topicAdvanced Combinatorial MathematicsFrench-language works237,207