Book Review: Gröbner deformations of hypergeometric\linebreak[1] differential equations
Bibliographic record
Abstract
This book is an introduction to new computational methods in the theory of linear PDE.To explain the terminology, the "old" methods, well predating the advent of computers, are concerned with approximate numerical solutions based on difference approximations to differential equations.The underlying mathematical point of view here is that a function is given by a table of its values.In contrast, the new computational methods forming the subject of this book are symbolic, i.e., based on the idea that a function is best given by a formula, e.g., as an explicit polynomial or power series.The goal then is to obtain an algorithm for finding the formula for the solution (e.g., finding the coefficients of its power series expansion) rather than for determining its values at a series of points.The paradigm of symbolic, as opposed to numerical, computation first demonstrated its power in algebra, where it allowed a computer to handle the "abstract" algebra of rings and modules while the numerical approach was restricted to the more "classical" algebra of numbers and equations.This development was of fundamental importance for algebraic geometry since sophisticated questions about algebraic varieties were opened up for direct computer-assisted testing.The key mathematical concept here is that of Gröbner bases (see below).There are several excellent books on this subject, such as [1], [11].The book under review is the first monograph in English on the application of Gröbner bases to differential equations and should be welcomed most enthusiastically.The authors give both a general treatment of holonomic systems of PDE and Gröbner bases methods for their solutions and illustrate the computational methods on a particular class of such systems coming from the theory of hypergeometric functions.In what follows we discuss the main concepts involved in more detail.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.038 | 0.023 |
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".