The command RegularGcdBySpecializationCube returns a list of pairs  where  is a polynomial and  is a regular chain such that the regular chains  all together form a triangular decomposition of rc in the sense of Lazard, and each polynomial  is a GCD of f1 and f2 modulo rc_i, for all . See the command RegularGcd for details on this notion of polynomial GCD modulo the saturated ideal of a regular chain.

f1 and f2 must have the same main variable v, with  and ,  both regular w.r.t the saturated ideal of rc.

The resultant of f1 and f2 w.r.t. v must be null modulo the saturated ideal of rc.

R must have a prime characteristic  such that FFT-based polynomial arithmetic can be used for this actual computation. The higher the degrees of f1 and f2 are, the larger  must be such that  divides .  If the degree of f1 or f2 is too large, then an error is raised.

The algorithm implemented by the command RegularGcd is more general and does not require the latter two assumptions. However, when both commands can be used the command RegularGcdBySpecializationCube is very likely to outperform RegularGcd, since it relies on modular techniques and asymptotically fast polynomial arithmetic.