MétaCan
Menu
← Back to cohort
Record W7066504341

Gröbner Geometry for Hessenberg Varieties

2024· dissertation· en· W7066504341 on OpenAlexfundno aff

Bibliographic record

VenueMacSphere (McMaster University) · 2024
Typedissertation
Languageen
FieldPhysics and Astronomy
TopicMagnetic confinement fusion research
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsNilpotentNilpotent matrixConjectureIntersection (aeronautics)Nilpotent groupPermutation (music)EmbeddingAlgebra over a field
DOInot available

Abstract

fetched live from OpenAlex

We study Hessenberg varieties in type A via their local defining equations, called patch ideals. We focus on two main classes of Hessenberg varieties: those associated to a regular nilpotent operator and to those associated to a semisimple operator. In the setting of regular semisimple Hessenberg varieties, which are known to be smooth and irreducible, we determine that their patch ideals are triangular complete intersections, as defined by Da Silva and Harada. For semisimple Hessenberg varieties, we give a partial positive answer to a conjecture of Insko and Precup that a given family of set-theoretic local defining ideals are radical. A regular nilpotent Hessenberg Schubert cell is the intersection of a Schubert cell with a regular nilpotent Hessenberg variety. Following the work of the author with Da Silva, Harada, and Rajchgot, we construct an embedding of the regular nilpotent Hessenberg Schubert cells into the coordinate chart of the regular nilpotent Hessenberg variety corresponding to the longest-word permutation in Bruhat order. This allows us to use work of Da Silva and Harada to conclude that regular nilpotent Hessenberg Schubert cells are also local triangular complete intersections.

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.000
metaresearch head score (Gemma)0.000
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: Empirical
Teacher disagreement score0.006
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0060.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.230
Teacher spread0.220 · 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
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueMacSphere (McMaster University)→Same topicMagnetic confinement fusion research→French-language works237,207→