Back to Forum | View unanswered posts | View active topics





Post a reply
Username:
Note:If not registered, provide any username. For more comfort, register here.
Subject:
Message body:
Enter your message here, it may contain no more than 60000 characters. 

Smilies
:D :) :( :o :shock: :? 8) :lol: :x :P :oops: :cry: :evil: :twisted: :roll: :wink: :!: :?: :idea: :arrow: :| :mrgreen:
Font size:
Font colour
Options:
BBCode is ON
[img] is ON
[flash] is OFF
[url] is ON
Smilies are ON
Disable BBCode
Disable smilies
Do not automatically parse URLs
Confirmation of post
To prevent automated posts the board requires you to enter a confirmation code. The code is displayed in the image you should see below. If you are visually impaired or cannot otherwise read this code please contact the %sBoard Administrator%s.
Confirmation code:
Enter the code exactly as it appears. All letters are case insensitive, there is no zero.
   

Topic review - Problems with the code
Author Message
hannes
  Post subject:  Re: Problems with the code  Reply with quote
Groebner base computations can be very complicated.
(and minAssGTZ start with one).
Try facstd as a preprocessing step and apply minAssGTZ to each L[i]:
Code:
list L=facstd(i);
for(int j=size(L);j>0;j--) { minAssGTZ(L[i]); }
Post Posted: Fri Jun 15, 2018 5:20 pm
anamtr
  Post subject:  Problems with the code  Reply with quote
Hello!

Can anybody help me with this code? One of then give me a solution while the other runs and close.

This one gives solutions:

Code:
LIB "ring.lib";
LIB "modstd.lib";

option(redSB);

option(prot);

ring r=0,(g, h, k0, k1, k2, r0, r1, r2, r3, r4, r5, r6, r7, r8, r9),dp;

r;

ideal i=(-(k0*r0) + ((-1 + 2*h)*r1)/(g + h)^2 + ((-1 + 2*g)*r2)/(g + h)^2, -(k2*r0) - r2 - k0*r2 + ((-1 + 2*h)*r4)/(g + h)^2 + (2*(-1 + 2*g)*r5)/(g + h)^2,
h*r2 - k2*r2 - 2*r5 - k0*r5 + ((-1 + 2*h)*r8)/(g + h)^2 + (3*(-1 + 2*g)*r9)/(g + h)^2, 2*h*r5 - k2*r5 - 3*r9 - k0*r9, 3*h*r9 - k2*r9,
-(k1*r0) + r1 - k0*r1 + (2*(-1 + 2*h)*r3)/(g + h)^2 + ((-1 + 2*g)*r4)/(g + h)^2, (-1 + h)*r1 - k2*r1 + (-1 + g)*r2 - k1*r2 - k0*r4 + (2*(-1 + 2*h)*r7)/(g + h)^2 +
  (2*(-1 + 2*g)*r8)/(g + h)^2, (-1 + h)*r4 + h*r4 - k2*r4 + 2*(-1 + g)*r5 - k1*r5 - r8 - k0*r8, (-1 + h)*r8 + 2*h*r8 - k2*r8 + 3*(-1 + g)*r9 - k1*r9, 0,
g*r1 - k1*r1 + 2*r3 - k0*r3 + (3*(-1 + 2*h)*r6)/(g + h)^2 + ((-1 + 2*g)*r7)/(g + h)^2, 2*(-1 + h)*r3 - k2*r3 + (-1 + g)*r4 + g*r4 - k1*r4 + r7 - k0*r7,
2*(-1 + h)*r7 + h*r7 - k2*r7 + 2*(-1 + g)*r8 + g*r8 - k1*r8, 0, 0, 2*g*r3 - k1*r3 + 3*r6 - k0*r6, 3*(-1 + h)*r6 - k2*r6 + (-1 + g)*r7 + 2*g*r7 - k1*r7, 0, 0, 0, 3*g*r6 - k1*r6,
0, 0, 0, 0);


minAssGTZ(i);


This one runs for some time and close:

Code:
LIB "ring.lib";
LIB "modstd.lib";

option(redSB);

option(prot);

ring r=0,(a, d0, d1, d10, d11, d12, d13, d14, d2, d3, d4, d5, d6, d7, d8, d9, h, k0, k1, k2),dp;

r;

ideal i=(a*d1*(-1 + 2*h) - d0*k0, -d2 + a*d4*(-1 + 2*h) - d2*k0 - d0*k2, -2*d5 + d2*h + a*d8*(-1 + 2*h) - d5*k0 - d2*k2, -3*d9 + 2*d5*h + a*d13*(-1 + 2*h) - d9*k0 - d5*k2,
-4*d14 + 3*d9*h - d14*k0 - d9*k2, 4*d14*h - d14*k2, d1 + 2*a*d3*(-1 + 2*h) - d1*k0 - d0*k1, -d2/2 + d1*(-1 + h) + 2*a*d7*(-1 + 2*h) - d4*k0 - d2*k1 - d1*k2,
-d5 - d8 + d4*(-1 + h) + d4*h + 2*a*d12*(-1 + 2*h) - d8*k0 - d5*k1 - d4*k2, -2*d13 - (3*d9)/2 + d8*(-1 + h) + 2*d8*h - d13*k0 - d9*k1 - d8*k2,
-2*d14 + d13*(-1 + h) + 3*d13*h - d14*k1 - d13*k2, 0, d1/2 + 2*d3 + 3*a*d6*(-1 + 2*h) - d3*k0 - d1*k1, d7 + 2*d3*(-1 + h) + 3*a*d11*(-1 + 2*h) - d7*k0 - d4*k1 - d3*k2,
-d8/2 + 2*d7*(-1 + h) + d7*h - d12*k0 - d8*k1 - d7*k2, -d13 + 2*d12*(-1 + h) + 2*d12*h - d13*k1 - d12*k2, 0, 0, d3 + 3*d6 + 4*a*d10*(-1 + 2*h) - d6*k0 - d3*k1,
2*d11 + d7/2 + 3*d6*(-1 + h) - d11*k0 - d7*k1 - d6*k2, 3*d11*(-1 + h) + d11*h - d12*k1 - d11*k2, 0, 0, 0, 4*d10 + (3*d6)/2 - d10*k0 - d6*k1,
d11 + 4*d10*(-1 + h) - d11*k1 - d10*k2, 0, 0, 0, 0, 2*d10 - d10*k1);


minAssGTZ(i);


Thanks!
Post Posted: Wed Jun 13, 2018 6:18 pm


It is currently Fri May 13, 2022 10:56 am
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group