Bibliographic record
Abstract
When G is a complex reductive algebraic group, MV polytopes are in bijection with the non-negative tropical points of the unipotent group of G . By fixing w from the Weyl group, we can define MV polytopes whose highest vertex is labelled by w . We show that these polytopes are in bijection with the non-negative tropical points of the reduced double Bruhat cell labelled by w^{-1} . To do this, we define a collection of generalized minor functions \Delta_{\gamma}^{\mathrm{new}} which tropicalize on the reduced Bruhat cell to the BZ data of an MV polytope of highest vertex w . We also describe the combinatorial structure of MV polytopes of highest vertex w . We explicitly describe the map from the Weyl group to the subset of elements bounded by w in the Bruhat order which sends u \mapsto v if the vertex labelled by u coincides with the vertex labelled by v for every MV polytope of highest vertex w . As a consequence of this map, we prove that these polytopes have vertices labelled by Weyl group elements less than w in the Bruhat order.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".