{"paper":{"title":"Signature-based M\\\"oller's algorithm for strong Gr\\\"obner bases over PIDs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Maria Francis, Thibaut Verron","submitted_at":"2019-01-28T10:38:11Z","abstract_excerpt":"Signature-based algorithms are the latest and most efficient approach as of today to compute Gr\\\"obner bases for polynomial systems over fields. Recently, possible extensions of these techniques to general rings have attracted the attention of several authors.\n  In this paper, we present a signature-based version of M\\\"oller's classical variant of Buchberger's algorithm for computing strong Gr\\\"obner bases over Principal Ideal Domains (or PIDs). It ensures that the signatures do not decrease during the algorithm, which makes it possible to apply classical signature criteria for further optimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09586","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}