$c=1$. In this case all points in $C$ are affine, $b$ is an irreducible univariate polynomial, and $a$ is an irreducible bivariate polynomial, with the property that the $y$-coordinates of all points $P\in C$ are precisely the roots $\mathrm{\beta }$ of $b\left(y\right)=0$ and the $x$-coordinates are precisely the roots $\mathrm{\alpha }$ of $a\left(x\,\mathrm{\beta }\right)=0$ for some such $\mathrm{\beta }$. The cycle description of $C$ is

$b=1$ and $c=0$. In this case all points in $C$ are at infinity and $a$ is an irreducible univariate polynomial with the property that the $x$-coordinates of all points $P\in C$ are precisely the roots $\mathrm{\alpha }$ of $a\left(x\right)=0$. The cycle description of $C$ is $\mathrm{sum}\left(\left[\mathrm{\alpha }\,1\,0\right]\,a\left(\mathrm{\alpha }\right)=0\right)$.

$\left[a\,b\,c\right]=\left[1\,0\,0\right]$, a special point at infinity.

'sort'='multiplicity': If this optional argument is specified, the output will be sorted by increasing multiplicity.

Otherwise, by default, affine points precede points at infinity in the output order, and further to this the output is sorted by increasing degree of $b$ and then by increasing degree of $a$.

The intersectcurves command computes the intersection cycle, i.e., the formal sum of the intersection points in the projective plane, with multiplicities, of the two plane algebraic curves given by $f=0$ and $g=0$, respectively.

If f and g are  polynomials in x and y, and either z=1 or z is omitted, then the intersection cycle of their homogenized versions $z^{\mathrm{deg}\left(f\right)}f\left(\frac{x}{z}\,\frac{y}{z}\right)$ and $z^{\mathrm{deg}\left(g\right)}g\left(\frac{x}{z}\,\frac{y}{z}\right)$ is computed.

If z is specified and f and g are polynomials in x, y, and z, both polynomials are required to be homogeneous.

The polynomials f and g are assumed to have no nonconstant common factor. This can be checked using gcd. Otherwise an error message will be generated.

$\mathrm{with}\left(\mathrm{algcurves}\right)\:$

$\mathrm{intersectcurves}\left(x^2+y^2-1\,x^2+y^2-4\,x\,y\right)$

$\left[\left[2\,\left[x^2+1\,1\,0\right]\right]\right]$

$f≔y^2{z}^3-x^3{z}^2-x^5$

$f≔-x^5-x^3{z}^2+y^2{z}^3$

$g≔y^2{z}^3-x^3{z}^2-x^{4}z$

$g≔-x^{4}z-x^3{z}^2+y^2{z}^3$

$L≔\mathrm{intersectcurves}\left(f\,g\,x\,y\,z\,t\,u\right)$

$L≔\left[\left[8\,\left[t\,u\,1\right]\right]\,\left[1\,\left[t-1\,u^2-2\,1\right]\right]\,\left[15\,\left[t\,1\,0\right]\right]\right]$

$\mathrm{eval}\left(\left[f\,g\right]\,\left[x=0\,y=0\,z=1\right]\right)$

$\left[0\,0\right]$

$\mathrm{eval}\left(\left[f\,g\right]\,\left[x=1\,y=\mathrm{sqrt}\left(2\right)\,z=1\right]\right)$

$\left[0\,0\right]$

$\mathrm{eval}\left(\left[f\,g\right]\,\left[x=1\,y=-\mathrm{sqrt}\left(2\right)\,z=1\right]\right)$

$\left[0\,0\right]$

$\mathrm{eval}\left(\left[f\,g\right]\,\left[x=0\,y=1\,z=0\right]\right)$

$\left[0\,0\right]$

$\mathrm{degree}\left(f\right)\mathrm{degree}\left(g\right)$

$25$

$L≔\mathrm{intersectcurves}\left(f\,g\,x\,y\,z\,t\,u\,'\mathrm{sort}'='\mathrm{multiplicity}'\right)$

$L≔\left[\left[1\,\left[t-1\,u^2-2\,1\right]\right]\,\left[8\,\left[t\,u\,1\right]\right]\,\left[15\,\left[t\,1\,0\right]\right]\right]$

$A≔\left(y-z\right)x^5+\left(y^2-yz\right)x^4+\left(y^3-y^{2}z\right)x^3+\left(-y^2{z}^2+y{z}^3\right)x^2+\left(-y^3{z}^2+y^2{z}^3\right)x-y^4{z}^2+y^3{z}^3$

$A≔\left(y-z\right)x^5+\left(y^2-yz\right)x^4+\left(y^3-y^{2}z\right)x^3+\left(-y^2{z}^2+y{z}^3\right)x^2+\left(-y^3{z}^2+y^2{z}^3\right)x-y^4{z}^2+y^3{z}^3$

$B≔\left(y^2-2z^2\right)x^2+\left(y^3-2y{z}^2\right)x+y^4-y^2{z}^2-2z^4$

$B≔\left(y^2-2z^2\right)x^2+\left(y^3-2y{z}^2\right)x+y^4-y^2{z}^2-2z^4$

$\mathrm{intersectcurves}\left(A\,B\,x\,y\,z\right)$

$\left[\left[1\,\left[x^2+x+2\,y-1\,1\right]\right]\,\left[1\,\left[x+y\,y^2+1\,1\right]\right]\,\left[1\,\left[x^2+yx+2\,y^2-2\,1\right]\right]\,\left[1\,\left[x^3-y\,y^2-2\,1\right]\right]\,\left[1\,\left[-y^3+x\,y^4+1\,1\right]\right]\,\left[2\,\left[x^2+x+1\,1\,0\right]\right]\,\left[2\,\left[1\,0\,0\right]\right]\right]$

$\left[x^2+x+2\,y-1\,1\right]$ is the formal sum of the two points $\left[\mathrm{\alpha }\,1\,1\right]$, where $\mathrm{\alpha }$ runs over the two roots of $x^2+x+2$;

$\left[x+y\,y^2+1\,1\right]$ is the formal sum of the two points $\left[\mathrm{-I}\,\mathrm{I}\,1\right]\+\left[\mathrm{I}\,\mathrm{-I}\,1\right]$;

$\left[x^2+yx+2\,y^2-2\,1\right]$ is the formal sum of the two points $\left[{\mathrm{\alpha }}_1\,\sqrt{2}\,1\right]$, where ${\mathrm{\alpha }}_1$ runs over the two roots of $x^2+\sqrt{2}x+2$, plus the formal sum of the two points $\left[{\mathrm{\alpha }}_2\,-\sqrt{2}\,1\right]$, where ${\mathrm{\alpha }}_2$ runs over the two roots of $x^2-\sqrt{2}x+2$.

$\left[x^3-y\,y^2-2\,1\right]$ is the formal sum of the six points $\left[\mathrm{\alpha }\,{\mathrm{\alpha }}^3\,1\right]$, where $\mathrm{\alpha }$ runs over the roots of $x^6-2$, i.e., the $6$th roots of $2$;

$\left[-y^3+x\,y^4+1\,1\right]$ is the formal sum of the four points $\left[{\mathrm{\beta }}^3\,\mathrm{\beta }\,1\right]$, where $\mathrm{\beta }$ runs over the four roots ${\ⅇ}^{\frac{\mathrm{I}}{4}\mathrm{\pi }},{\ⅇ}^{\frac{3\mathrm{I}}{4}\mathrm{\pi }},{\ⅇ}^{\frac{5\mathrm{I}}{4}\mathrm{\pi }},{\ⅇ}^{\frac{7\mathrm{I}}{4}\mathrm{\pi }}$ of $y^4+1$, i.e., the primitive $8$th roots of unity;

$\left[x^2+x+1\,1\,0\right]$ is the formal sum of the two points $\left[{\ⅇ}^{\frac{2\mathrm{I}}{3}\mathrm{\pi }}\,1\,0\right]\+\left[{\ⅇ}^{\frac{4\mathrm{I}}{3}\mathrm{\pi }}\,1\,0\right]$, where ${\ⅇ}^{\frac{2\mathrm{I}}{3}\mathrm{\pi }},{\ⅇ}^{\frac{4\mathrm{I}}{3}\mathrm{\pi }}$ are the two roots of $x^2+x+1$, i.e., the primitive cube roots of unity.

J. Hilmar and C. Smyth, Euclid meets Bezout: intersecting algebraic plane curves with the Euclidean algorithm, American Mathematical Monthly 117 (2010), 250-260.

The algcurves[intersectcurves] command was introduced in Maple 17.

For more information on Maple 17 changes, see Updates in Maple 17.