Matroid configurations and symbolic powers of their ideals
Bibliographic record
Abstract
Star configurations are certain unions of linear subspaces of projective space that have been studied extensively. We develop a framework for studying a substantial generalization, which we call matroid configurations, whose ideals generalize Stanley-Reisner ideals of matroids. Such a matroid configuration is a union of complete intersections of a fixed codimension. Relating these to the Stanley-Reisner ideals of matroids and using methods of liaison theory allows us, in particular, to describe the Hilbert function and minimal generators of the ideal of, what we call, a hypersurface configuration. We also establish that the symbolic powers of the ideal of any matroid configuration are Cohen-Macaulay. As applications, we study ideals coming from certain complete hypergraphs and ideals derived from tetrahedral curves. We also consider Waldschmidt constants and resurgences. In particular, we determine the resurgence of any star configuration and many hypersurface configurations. Previously, the only non-trivial cases for which the resurgence was known were certain monomial ideals and ideals of finite sets of points. Finally, we point out a connection to secant varieties of varieties of reducible forms.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 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".