# Singular

 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
 Font size: Tiny Small Normal Large Huge Font colour [quote="mht208"]Suppose there is a set I = {i1, i2, …, in} of polynomials and a Groebner basis J = {j1, j2, …, jm} of I. Is there a way in Singular to find q1, q2, …, qn for each polynomial jk in J such that the following holds (i.e., represent jk as a combination of polynomials in I)? jk = q1*i1 + q2*i2 + … + qn*in[/quote]
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 - Find how Groebner basis is constructed from polynomials
Author Message
 Guest
 Post subject: Re: Find how Groebner basis is constructed from polynomials
 I tried the lift function and it works. Thank you very much. I tried the lift function and it works. Thank you very much.
 Posted: Mon Sep 05, 2016 2:26 am
 hannes
 Post subject: Re: Find how Groebner basis is constructed from polynomials
 lift does thishttp://www.singular.uni-kl.de/Manual/4-0-3/sing_334.htmresp. liftstdhttp://www.singular.uni-kl.de/Manual/4-0-3/sing_335.htm lift does thishttp://www.singular.uni-kl.de/Manual/4-0-3/sing_334.htmresp. liftstdhttp://www.singular.uni-kl.de/Manual/4-0-3/sing_335.htm
 Posted: Sat Sep 03, 2016 7:02 pm
 mht208
 Post subject: Find how Groebner basis is constructed from polynomials
 Suppose there is a set I = {i1, i2, …, in} of polynomials and a Groebner basis J = {j1, j2, …, jm} of I. Is there a way in Singular to find q1, q2, …, qn for each polynomial jk in J such that the following holds (i.e., represent jk as a combination of polynomials in I)? jk = q1*i1 + q2*i2 + … + qn*in Suppose there is a set I = {i1, i2, …, in} of polynomials and a Groebner basis J = {j1, j2, …, jm} of I. Is there a way in Singular to find q1, q2, …, qn for each polynomial jk in J such that the following holds (i.e., represent jk as a combination of polynomials in I)? jk = q1*i1 + q2*i2 + … + qn*in
 Posted: Thu Sep 01, 2016 10:16 am

 It is currently Fri Aug 17, 2018 6:59 pm