شرايط تركيبياتي براي بعضي تحليل هاي خطي ايده‌‌آل هاي تك جمله‌اي

COMBINATORIAL CONDITION FOR LINEARITY IN THE FIRST STEPS OF RESOLUTION OF MONOMIAL IDEALS

در جبرِجابجايي تركيبياتي، روش‌‌هاي متعددي براي برقراري ارتباط بين اشياي تركيبياتي و اشياي جبري وجود دارد. در اين مقاله از طريق متناظر كردن ايده‌آل‌هاي تك جمله‌اي با گراف‌ها و مجتمع‌هاي سادكي به مطالعۀ اين اشياء مي‌پردازيم. مهمترين ايده‌آل‌هاي تك ‌جمله‌اي قابل بحث ، ايده‌آل‌هاي يالي و ايده‌آل‌هاي استنلي - ريزنرِ مجتمع‌هاي سادكي مي‌باشند. فرض كنيد r يك عدد صحيح مثبت باشد. ايده‌‌آل تك جمله‌‌اي I ، خطي تا r مرحله اول ناميده مي شود هرگاه، براي بعضي اعداد صحيح چون d و براي تمام 0≤i.

There has been many researches in the field of combinational commutative algebra; however, what makes this research distinct from the previous ones is its focus on monomial ideals and their connection to graphs. The present study aims at various goals one of which is analyzing the existence of linear resolution of such ideals. Concerning combinatorial commutative algebra there are numerous methods for creating connection between combinational objects and algebric objects. This article is to study such objects through corresponding monomial ideals with graphs and simplicial complexes. The most significant treatable ideals of simplicial complex include edge ideal and Stanly-Reisner ideal. Let r be a positive integer. A monomial ideal I is said to be linear in the first r steps, if for some integer d , β_(i.i+j) (I)=0 for all 0≤i