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 - ideal quotient
Author Message
  Post subject:  Re: ideal quotient  Reply with quote
see http://www.singular.uni-kl.de/Manual/4-0-3/sing_334.htm
Code:
matrix T=lit(ideal(h*k),ideal(f,g));
// the factors are:
T[1,1]; // f_1
T[1,2]; // g_1
Post Posted: Fri Jun 10, 2016 11:12 am
  Post subject:  ideal quotient  Reply with quote
Hello,

I have 3 homogeneous polynomials f, g, h and I have the ideal quotient (colon) K = I:J where I and J are ideals: I = (f, g), J=(h).
I have also the homogeneous polynomial k of minimal degree from ideal quotient K.
From the definition of the ideal quotient, there must be 2 polynomials f_1, g_1 and so we have:
h * k = f * f_1 + g * g_1.
How can I find these two polynomials f_1 and g_1 with Singular?

Thanks in advance
Post Posted: Thu Jun 09, 2016 12:40 pm


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