The command ExtendedNormalizedGcd(p1, p2, v, rc, R) returns a list of pairs  where , ,  are polynomials of R and  is a regular chain of R.

For each pair, the polynomial  is a normalized GCD of p1 and p2 modulo the saturated ideal of .

For each pair, the polynomials , ,  satisfy  modulo the saturated ideal of .

For each pair, the leading coefficient of the polynomial  with respect to v is normalized (and thus regular) modulo the saturated ideal of .

The returned regular chains  form a triangular decomposition of rc (in the sense of Kalkbrener).

The returned regular chains are strongly normalized.

Comparing to ExtendedRegularGcd, the output of ExtendedNormalizedGcd will look simpler in general when rc is zero-dimensional.

However, the output of ExtendedNormalizedGcd may be much larger and much more expensive to get than the one of ExtendedRegularGcd, when rc is not zero-dimensional.

rc must be strongly normalized.

v must be the common main variable of p1 and p2.

The initials of p1 and p2 must be regular with respect to rc.

This command is part of the RegularChains[ChainTools] package, so it can be used in the form ExtendedNormalizedGcd(..) only after executing the command with(RegularChains[ChainTools]).  However, it can always be accessed through the long form of the command by using RegularChains[ChainTools][ExtendedNormalizedGcd](..).

Moreno Maza, M. "On triangular decompositions of algebraic varieties" Technical Report 4/99, NAG, UK, Presented at the MEGA-2000 Conference, Bath, UK. Available at http://www.csd.uwo.ca/~moreno.