Re: muldep

[Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>]

On Wed, Dec 09, 2020 at 02:13:11PM +0000, John Cremona wrote:
> Hello Denis,
> 
> As a first step, using only gcds you can extract from your x_i a list
> of integers p_i which are mutually coprime -- but not necessarily
> prime -- so that each x_i is a product of powers of the p_i.  There is
> a name for that process, which I forget.  Then your problem  becomes
> one of finding the kernel of an integer matrix, which you know how to
> do.  I was thinking of the x_i as being integers, but just apply this
> to the list of all numerators and denominators.

As a starting point, under GP you can do
install("ZV_cba","mG");
? ZV_cba([15,10,14])
%3 = [3,5,2,7]

Cheers,
Bill.