macsyma on Thu, 01 Aug 2019 04:40:35 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: nfgaloisconj

> Bill Allombert on Wed, 31 Jul 2019 11:06:53 +0200

Thank you, Bill.

> I was expecting that if the degree of g get large, finding 
> p would be costly.

I think too that your method is superior 
if we consider the root separation of a polynomial having higher degree.
However, in consideration of the range of degree that can be handled in practice (<=10^3?) , 
it might not be able to demonstrate its ability.

The following is a timing data for f = x^n-2.

 [n,d,processing time of [G12p(f), nfsplittingaut(f)]]

> Bill Allombert on Wed, 31 Jul 2019 14:01:56 +0200

> 2) if the order of the Galois group is not given and the group is not
> the symmetric group, then nfsplitting already computes a large part of
> nfisincl to check that the tower stops, so we could arrange for
> nfsplitting to return also the embeddings.That is good news.

That is good news.