MétaCan
Menu
Back to cohort
Record W4237114245 · doi:10.4153/s0008439518000140

Tits Triangles

2018· article· en· W4237114245 on OpenAlexvenueno aff
Bernhard Mühlherr, Richard M. Weiss

Bibliographic record

VenueCanadian Mathematical Bulletin · 2018
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsnot available
Fundersnot available
KeywordsUnicodeMathematicsCombinatoricsVertex (graph theory)Rank (graph theory)Discrete mathematicsGraphComputer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

Abstract A Tits polygon is a bipartite graph in which the neighborhood of every vertex is endowed with an “opposition relation” satisfying certain properties. Moufang polygons are precisely the Tits polygons in which these opposition relations are all trivial. There is a standard construction that produces a Tits polygon whose opposition relations are not all trivial from an arbitrary pair $(\unicode[STIX]{x1D6E5},T)$ , where $\unicode[STIX]{x1D6E5}$ is a building of type $\unicode[STIX]{x1D6F1}$ , $\unicode[STIX]{x1D6F1}$ is a spherical, irreducible Coxeter diagram of rank at least $3$ , and $T$ is a Tits index of absolute type $\unicode[STIX]{x1D6F1}$ and relative rank $2$ . A Tits polygon is called $k$ -plump if its opposition relations satisfy a mild condition that is satisfied by all Tits triangles coming from a pair $(\unicode[STIX]{x1D6E5},T)$ such that every panel of $\unicode[STIX]{x1D6E5}$ has at least $k+1$ chambers. We show that a $5$ -plump Tits triangle is parametrized and uniquely determined by a ring $R$ that is alternative and of stable rank $2$ . We use the connection between Tits triangles and the theory of Veldkamp planes as developed by Veldkamp and Faulkner to show existence.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.801
Threshold uncertainty score0.978

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.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0230.059

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.007
GPT teacher head0.172
Teacher spread0.165 · 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; both teacher heads agree on what is shown here.

Study designNot applicable
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

Citations2
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Mathematical BulletinSame topicgraph theory and CDMA systemsFrench-language works237,207