Hyperplane Arrangements and the Bernstein-Gelfand-Gelfand Correspondence
Bibliographic record
Abstract
The Chen ranks conjecture has stimulated work that involves ideas from the theory of hyperplane arrangements and homological algebra, namely the Bernstein-Gelfand-Gelfand (BGG) correspondence. The conjecture is an attempt to give a combinatorial formula for the Chen ranks invariants of a hyperplane arrangement. In 2005, Schenck and Suciu proved half of the conjecture. First, we motivate the necessary definitions and explain the connections between the field of hyperplane arrangements and the field of homological algebra with the goal of explaining the Chen ranks conjecture to the reader. The reader is not assumed to have any background in hyperplane arrangements, but some familiarity with homological algebra. SINGULAR routines were used to drastically simplify the calculations for the Chen invariant of an arbitrary hyperplane arrangement. Apart from the Chen invariant, our routine can calculate two other invariants associated to an arrangement with a high degree of efficiency. Thus, it has proven itself to be a very useful tool in studying arrangements. The difficulty with proving the conjecture is that the formulae involved are extremely complicated and difficult to compute by hand. To overcome this, we tried to verify the conjecture through the examination of examples. So far in all the examples we have examined, we have not found any contradictions; rather, we are very optimistic about the validity of the conjecture.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.010 | 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".