MétaCan
Menu
Back to cohort
Record W2464139764 · doi:10.1090/mcom/3076

Computation of invariants of finite abelian groups

2015· article· en· W2464139764 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueMathematics of Computation · 2015
Typearticle
Languageen
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaAgence Nationale de la RechercheNanyang Technological UniversityDivision of Mathematical SciencesNational University of Singapore
KeywordsMathematicsGenerating set of a groupAbelian groupInvariant (physics)Homogeneous spaceComputationPolynomialInteger (computer science)Discrete mathematicsAlgebra over a fieldPure mathematicsAlgorithmComputer scienceMathematical analysisGeometry

Abstract

fetched live from OpenAlex

We investigate the computation and applications of rational invariants of the linear action of a finite abelian group in the nonmodular case. By diagonalization, such a group action can be described by integer matrices of orders and exponents. We make use of integer linear algebra to compute a minimal generating set of invariants along with the substitution needed to rewrite any invariant in terms of this generating set. In addition, we show how to construct a minimal generating set that consists only of polynomial invariants. As an application, we provide a symmetry reduction scheme for polynomial systems whose solution set is invariant by a finite abelian group action. Finally, we also provide an algorithm to find such symmetries given a polynomial system.

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 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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.539
Threshold uncertainty score0.513

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.041
GPT teacher head0.268
Teacher spread0.228 · 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