A Maple implementation of a modular algorithm for computing the common zeros of a polynomial and a regular chain
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
One of the core commands in the RegularChains library isTriangularize. The underlying decomposes the solution set of anpolynomial system into geometrically meaningful components representedby regular chains. This algorithm works by repeatedly calling aprocedure, called Intersect, which computes the common zeros of apolynomial p and a regular chain T.As the number of variables of p and T, as well as their degrees,increase, the call Intersect(p, T) becomes more and morecomputationally expensive. It was observed in (C. Chen an M. MorenoMaza, JSC 2012) that when the input polynomial system iszero-dimensional and T is one-dimensional then this cost can besubstantially reduced. The method proposed by the authors is aprobabilistic algorithm based on evaluation and interpolationtechniques. This is the type of method which is typically challengingto implement in a high-level language like Maple's language, as asharp control of computing resources (in particular memory) is needed.In this paper, we report on a successful Maple implementation of thisalgorithm. We take advantage of Maple's modp1 function which offersfast arithmetic for univariate polynomials over a prime field.The method avoids unlucky specialization and the probabilistic aspectonly comes from the fact that non-generic solutions are notcomputed.
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it