The software provided on this web site is free. You can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation. It is distributed in the hope that it will be useful, but it comes without any warranty. The report of bugs is welcome.

  • [newtonPuiseux.m] A Mathematica implementation of the (multivariate) Newton-Puiseux algorithm. It accompanies the paper The Newton-Puiseux algorithm and effective algebraic series.

  • [nearSeparate.m] A Mathematica implementation of a semi-algorithm that takes an (irreducible) polynomial $p(x,y)\in\mathbb{C}[x,y]$ as input and outputs a description of all elements of $\mathbb{C}(x) + \mathbb{C}(y)$ whose numerator is a multiple of $p$. The semi-algorithm is described in the paper Separating variables in bivariate polynomial ideals: the local case.

  • [separate.m] A Mathematica implementation of an algorithm which takes a basis of an ideal $I\subseteq\mathbb{C}[x,y]$ and returns a description of all elements of $I\cap(\mathbb{C}[x] + \mathbb{C}[y]).$ It is based on the paper Separating variables in bivariate polynomial ideals.