MétaCan
Menu
Back to cohort
Record W3194363807 · doi:10.48550/arxiv.2108.07692

An Extension of the Erd\H{o}s-Ko-Rado Theorem to uniform set partitions

2021· preprint· en· W3194363807 on OpenAlexaff
Karen Meagher, Mahsa N. Shirazi, Brett Stevens

Bibliographic record

VenuearXiv (Cornell University) · 2021
Typepreprint
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsCarleton UniversityUniversity of Regina
Fundersnot available
KeywordsPartition (number theory)CombinatoricsMathematicsExtension (predicate logic)Block (permutation group theory)Discrete mathematicsComputer science

Abstract

fetched live from OpenAlex

A $(k,\\ell)$-partition is a set partition which has $\\ell$ blocks each of\nsize $k$. Two uniform set partitions $P$ and $Q$ are said to be partially\n$t$-intersecting if there exist blocks $P_{i}$ in $P$ and $Q_{j}$ in $Q$ such\nthat $\\left| P_{i} \\cap Q_{j} \\right|\\geq t$. In this paper we prove a version\nof the Erd\\H{o}s-Ko-Rado theorem for partially $2$-intersecting\n$(k,\\ell)$-partitions. In particular, we show for $\\ell$ sufficiently large,\nthe set of all $(k,\\ell)$-partitions in which a block contains a fixed pair is\nthe largest set of 2-partially intersecting $(k,\\ell)$-partitions. For for\n$k=3$, we show this result holds for all $\\ell$.\n

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.013
Threshold uncertainty score0.967

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.0010.002
Research integrity0.0000.001
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.108
GPT teacher head0.237
Teacher spread0.130 · 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

Citations0
Published2021
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicLimits and Structures in Graph TheoryFrench-language works237,207