MétaCan
Menu
Back to cohort

Some generalizations of Rédei’s theorem

2006· article· en· W2074001034 on OpenAlexaff
T. L. Alderson

Bibliographic record

VenueJournal of Discrete Mathematical Sciences and Cryptography · 2006
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsMathematicsProjective planeTransversal (combinatorics)CombinatoricsPlane (geometry)Affine plane (incidence geometry)Affine transformationLine (geometry)Order (exchange)Discrete mathematicsPure mathematicsMathematical analysisGeometry

Abstract

fetched live from OpenAlex

By the famous theorems of Rédei, a set of q points in AG(2, q) (respectively p points in AG(2, p), p prime) is either a line or it determines at least (respectively ) directions. We generalize these results on two fronts. First we provide bounds on the number of directions determined by a set of n≤q points in a general projective plane of order q. Secondly, given a dual n-arc in Π=PG(k, q) we consider Π as embedded in Σ=PG(k+1, q) where E=Σ–Π is the associated affine space. A collection of affine points is a transversal set of if any line incident with a k-fold point of is incident with at most one point of S. We reformulate Rédei’s results in the plane as results on transversal sets. In this setting we generalize Rédei’s theorems to higher dimensions. We also provide a new proof of a well known theorem on extending arcs in PG(k, q).

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.003
metaresearch head score (Gemma)0.009
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: none
Teacher disagreement score0.008
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0020.003
Scholarly communication0.0020.006
Open science0.0020.004
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0080.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.011
GPT teacher head0.242
Teacher spread0.232 · 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

Citations0
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Discrete Mathematical Sciences and CryptographySame topicCoding theory and cryptographyFrench-language works237,207