Singular https://www.singular.uni-kl.de/forum/ |
|
representation obtained by reduction? https://www.singular.uni-kl.de/forum/viewtopic.php?f=10&t=1685 |
Page 1 of 1 |
Author: | John Perry [ Fri Oct 17, 2008 11:34 pm ] |
Post subject: | representation obtained by reduction? |
Suppose that B is an ideal, f is a polynomial, and r is obtained via r = reduce(f,B); Then there exists a list H of polynomials such that f == H1*B1 + ... + Hm*Bm + r Does Singular have a function/option to determine H, after computing r? |
Author: | bricken [ Thu Oct 30, 2008 9:52 am ] |
Post subject: | |
Hi John! Lift might do the job. http://www.singular.uni-kl.de/Manual/3-0-4/sing_235.htm Michael |
Author: | John Perry [ Thu Oct 30, 2008 11:13 pm ] |
Post subject: | Lift yes, but... |
bricken wrote: Thanks, that helps a great deal. I don't know that it's as efficient as I'd like, maybe you can say. To use lift to "recover" the H's, I understand that I need to typeCode: r = reduce(f,B); When Singular performs the reduction, it computes H once.lift(B,f-r); Then, when Singular computes the lift, it computes H a second time. I'd prefer to compute H only the first time, and recover it without having Singular go through it again. |
Author: | greuel [ Sat Nov 15, 2008 3:12 am ] |
Post subject: | |
Hi, I guess 'division' is what you want. |
Author: | Guest [ Sat Nov 15, 2008 5:59 am ] |
Post subject: | |
greuel wrote: Hi, I guess 'division' is what you want. Thanks. Unfortunately, B is not necessarily a standard basis, and division appears to compute a standard basis of B before doing the division. For example, Code: > ring R=0,(x,y),dp; The answer I want is> ideal l = xy+1,y2+1; > poly f = x-y; > division(f,l); [1]: _[1,1]=-y _[2,1]=x [2]: _[1]=0 [3]: _[1,1]=1 Code: [1]: If I read the documentation correctly, division computes a standard basis, then lifts to l; I want the result from the non-standard basis. Is there an option to turn that behavior off?
_[1,1]=0 _[2,1]=0 [2]: _[1]=x-y [3]: _[1,1]=1 |
Page 1 of 1 | All times are UTC + 1 hour [ DST ] |
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group http://www.phpbb.com/ |