I've been back in touch with Christian Eder (thanks for assuring me he's
alive, Bill :-)) and he's happy to support an attempt to get the code into
Sage. He's working on extending the code to other fields & the like.
I will definitely apply for the afore-mentioned coding spring, to add at
least
Le mardi 27 novembre 2018 12:00:16 UTC+1, Simon King a écrit :
>
> Hi Bernard,
>
> On 2018-11-27, parisse > wrote:
> > I meant a more efficient elimination order like double revlex.
>
> Actually I've never heard of that. The only reference I could find with
> duckduckgo was the phrase
> "F
I can make my observation now a bit more precise, and I am sure that there
is a memory problem.
I used
sage -pip install memory_profiler
Let memory.py be the following file:
###
from memory_profiler import profile
@profile
def check_good(n):
f
Hi Bernard,
On 2018-11-27, parisse wrote:
> I meant a more efficient elimination order like double revlex.
Actually I've never heard of that. The only reference I could find with
duckduckgo was the phrase
"Fast Gröbner basis f4 algorithm (revlex order and double
revlex for elimination), fast
I meant a more efficient elimination order like double revlex.
Le lundi 26 novembre 2018 22:04:56 UTC+1, Simon King a écrit :
>
> Hi!
>
>
> What is your definition of "elimination order"? If I understand
> correctly, lex *is* an elimination order.
>
> Best regards,
> Simon
>
>
--
You receiv
