2 papers
cs.SC2026
A data structure for monomial ideals with applications to signature Gröbner bases
Pierre Lairez, Rafael Mohr, Théo Ternier
We introduce monomial divisibility diagrams (MDDs), a data structure for monomial ideals that supports insertion of new generators and fast membership tests. MDDs stem from a canon…
cs.SC2024
Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting
Jérémy Berthomieu, Rafael Mohr
We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifti…