MétaCan
Menu
Back to cohort
Record W7113171008

The Tropical Geometry of Flag Positroids

2024· article· en· W7113171008 on OpenAlexfundno aff

Bibliographic record

VenueDigital Access to Scholarship at Harvard (DASH) (Harvard University) · 2024
Typearticle
Languageen
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsFlag (linear algebra)GrassmannianMatroidVariety (cybernetics)Rank (graph theory)PolytopeLinear subspaceTree (set theory)
DOInot available

Abstract

fetched live from OpenAlex

Recently, there has been interest in the tropicalization of the Grassmannian, known as the tropical Grassmannian. It has been shown that the tropical Grassmannian, and a related tropical space called the Dressian, can be used to construct subdivisions of matroid polytopes into matroid polytopes. There has also been interest ``nonnegative" and ``flag" versions of the tropical Grassmannian and the Dressian, which can be used to construct subdivisions of ``nonnegative" and ``flag" versions of matroid polytopes. This thesis combines these perspectives, exploring ``nonnegative flag" versions of these objects. We show that, for flags whose ranks consist of consecutive integers, many nice results that hold in the previously studied settings have ``nonnegative flag" analogues. The nonnegative flag variety of rank r=(r_1,..., r_k), defined by Lusztig, can be described as the set of rank r flags of linear subspaces in R^n which can be represented by a matrix whose minors are all positive. We show that, for flag varieties of consecutive rank, this equals the subset of the flag variety with nonnegative Plücker coordinates. This generalizes the well-established fact, proven independently by many authors including Rietsch, Talaska and Williams, Lam, and Lusztig, that the nonnegative Grassmannian equals the subset of the Grassmannian with nonnegative Plücker coordinates, and yields a straightforward condition to determine whether a flag of consecutive rank lies in the nonnegative flag variety. A flag F in any nonnegative flag variety determines a combinatorial object called a flag positroid, defined in terms of the set of nonzero Plücker coordinates of F. We characterize flag positroids of consecutive ranks as oriented flag matroids whose constituents are positively oriented matroids. We also explore flag varieties using tropical geometry, which is the study of algebraic geometry over the (min,+) semifield. The tropical flag variety and the flag Dressian are tropical spaces parameterizing realizable and abstract flags of tropical linear spaces, respectively. In general, the flag Dressian strictly contains the tropical flag variety. However, we show that the nonnegative tropical flag variety and the nonnegative flag Dressian, which parameterize positively realizable and abstract flags of positive tropical linear spaces, respectively, are equal for flags of consecutive ranks. This generalizes the equality of the nonnegative Dressian and the nonnegative tropical Grassmannian, proven by Speyer and Williams. The flag Dressian is closely related to coherent subdivisions of flag matroid polytopes: it is a polyhedral complex whose cones parameterize coherent subdivisions of flag matroid polytopes into smaller flag matroid polytopes. We specialize this relationship to the nonnegative flag Dressian. We prove that the restriction of this parameterization to the cones of the nonnegative flag Dressian instead parameterizes coherent subdivisions of flag positroid polytopes into smaller flag positroid polytopes. In the special case of the positive (non-flag) Dressian, this recovers the description of coherent subdivisions of hypersimplices into positroid polytopes by Lukowski, Parisi, and Williams. In the special case of the nonnegative complete flag Dressian, this describes coherent subdivisions of Bruhat interval polytopes into Bruhat interval polytopes.

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 categoriesScholarly communication, Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.884
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0030.006
Open science0.0030.003
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.002

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.016
GPT teacher head0.237
Teacher spread0.221 · 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.

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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueDigital Access to Scholarship at Harvard (DASH) (Harvard University)Same topicPolynomial and algebraic computationFrench-language works237,207