# Wolfram Function Repository

Instant-use add-on functions for the Wolfram Language

Function Repository Resource:

Compute the Dixon resultant with respect to a set of polynomials and variables

Contributed by:
Daniel Lichtblau

ResourceFunction["DixonResultant"][ computes the Dixon resultant of |

The Dixon resultant, in effect, eliminates the chosen variables, returning a single polynomial in any remaining variables.

The number of polynomials must be one larger than the number of variables.

The polynomials can have coefficients that involve parameters. In this case, the parameters will also appear in the Dixon resultant.

ResourceFunction["DixonResultant"] is an implementation of the method by Kapur, Saxena and Yang (see Citations subsection).

As with the ordinary resultant, the resulting polynomial must vanish in order for there to be simultaneous roots to the given system. The points at which it vanishes thus provide necessary conditions for the simultaneous vanishing of the original system.

The Dixon resultant can have factors that do not give vanishing conditions for the input polynomials. These are known as "extraneous" (or "spurious") factors.

ResourceFunction["DixonResultant"] takes a Modulus option which must be 0 (default) or a prime.

Most examples come from the provided references.

Eliminate {*x*,*y*} from three polynomials to obtain conditions on the coefficient parameter, *a*, for which the polynomials simultaneously vanish:

In[1]:= |

Out[2]= |

We can find the specific values of *a* for which the three polynomials can simultaneously vanish in {*x*,*y*}:

In[3]:= |

Out[3]= |

Checking reveals that all but the last two values for *a* give rise to solutions in {*x*,*y*}:

In[4]:= |

Out[4]= |

Here are two polynomials that vanish at *x*=1:

In[5]:= |

Out[6]= |

Use the Dixon resultant modulo 127 to eliminate four variables from a system of five polynomials (example is taken from reference by Tang and Feng):

In[7]:= |

Out[8]= |

Dixon resultant computations involve symbolic row reduction and computation of determinants, and this can be slow (example is from Feng and Li reference):

In[9]:= |

Out[10]= |

The result is a polynomial that eliminates the variables {*b*,*d*} from the system and it is not small:

In[11]:= |

Out[11]= |

Here is a substantially more difficult example:

In[12]:= |

It is easy to obtain a resultant when numerical values are substituted for parameters:

In[13]:= |

Out[13]= |

Obtaining the parametrized resultant takes far longer:

In[14]:= |

Out[14]= |

This result is substantial:

In[15]:= |

Out[15]= |

Resultants can be used to recover the usual "discriminant" from school algebra, though with an extraneous factor (to account for the possibility of the leading term vanishing):

In[16]:= |

Out[17]= |

For two polynomials the Dixon resultant agrees with the usual resultant except perhaps for multiplicities of extraneous factors:

In[18]:= |

Out[18]= |

Define a polynomial surface implicitization problem (example is from the Tran reference):

In[19]:= |

Calculate the Dixon resultant:

In[20]:= |

Out[20]= |

A Groebner basis can also be used to eliminate variables; this example requires some non-default settings as well as a numeric-to-exact conversion in order to be at all efficient:

In[21]:= |

Out[21]= |

These agree up to a multiplicative constant (so there are no extraneous factors in the Dixon resultant in this example):

In[22]:= |

Out[22]= |

One common use of these resultants is to find the implicit form of a parametrized surface. We illustrate using two parametrized bicubic patches from the Newell (or Utah) Teapot. One gives an easy problem, whereas the other is more challenging:

In[23]:= |

In[24]:= |

Out[24]= |

Plot this surface:

In[25]:= |

Out[26]= |

Here is the plot of the original parametrized form:

In[27]:= |

Out[28]= |

The second patch above is substantially more difficult to put into implicit form:

In[29]:= |

Out[29]= |

In[30]:= |

Out[30]= |

- 1.1.0 – 13 August 2023
- 1.0.0 – 09 July 2020

This work is licensed under a Creative Commons Attribution 4.0 International License