Bit-size reduction of triangular sets in two and three variables
At ISSAC 2004, Schost and D.introduced a transformation of triangular lexicographic Groebner basesgenerating a radical ideal of dimension zero,which reduces significantly the bit-size of coefficients.The case where the triangular lexicographic Groebner basis does not generate a radical idealis far more complicated. This work treats the case of n=2 variables, andin some extent the case of n=3 variables.It resorts to an extra operation, the squarefree factorization;nevertheless this operation has low complexity cost.But as soon as n>2 variables a lack of simple and efficient gcd-like operationover non-reduced rings prevents to undertake meaningful algorithmic considerations.An implementation in Maple for the case n=2 confirms the expectedreduction of the expected size coefficients.