Post new topic Reply to topic  [ 3 posts ] 
Author Message
 Post subject: a problem in arithmetic dynamics
PostPosted: Mon Nov 30, 2015 4:38 pm 
Let I be an ideal generated by a finite number of binomials, and let I' be a larger ideal containing all polynomials p such that mp is contained in I for some monomial m. Is there an algorithm for computing I'?


Report this post
Top
  
Reply with quote  
 Post subject: Re: a problem in arithmetic dynamics
PostPosted: Tue Dec 01, 2015 5:06 pm 

Joined: Wed May 25, 2005 4:16 pm
Posts: 178
That seems to be the ideal qotient:
I:<x_1,...x_n>:={f, with f*g in I and g in <x_1..x_n>}
or
Code:
quotient(I,maxideal(1))
.
For the algorithm see
http://www.mathematik.uni-kl.de/~zca/Reports_on_ca/02/paper_html/node29.html


Report this post
Top
 Profile  
Reply with quote  
 Post subject: Re: a problem in arithmetic dynamics
PostPosted: Wed Dec 02, 2015 8:24 pm 
Thank you for the answer. However, the given quotient does not in general agree with I'. For example, if I is generated by s2-s and d4e+s, then I' contains the polynomial s-1 which is not in quotient(I,maxideal(1)).


Report this post
Top
  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 3 posts ] 

You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

It is currently Sat Dec 16, 2017 10:42 pm
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group