Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $ d >0 $ be an integer, and let $ I \subset K[x_1,...x_n] $ be a monomial ideal.

$ I = ( x_1^{a_1}x_2^{a_2}...x_n^{a_n} : \ \sum_{i=1}^n a_i =d; \ a_i < d \forall i)$.

(a) Compute the saturation $ \widetilde{I} $.

(b) The smallest integer $ k $ such that $ I : m^k = I : m^{k+1} $ is called the saturation number of $ I $. What is the saturation number of $ I $?

$ m = (x_1,...,x_n) $

The saturation $ \widetilde{I} $ of $ I $ is the ideal $ I : m^{\infty} = \cup_{k=1}^{\infty} I : m^k$

share|improve this question
Well, it seems that you will propose us to solve all the exercises from Herzog and Hibi. – YACP Nov 30 '12 at 20:12
you can give me some hints that is neccessary to solve them – daisy Dec 1 '12 at 0:40

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.