首页> 外文期刊>urnal of Symbolic Computation >Taylor and Lyubeznik Resolutions via Groebner Bases
【24h】

Taylor and Lyubeznik Resolutions via Groebner Bases

机译:通过Groebner Bases获得Taylor和Lyubeznik的决议

获取原文
获取原文并翻译 | 示例
       

摘要

Taylor presented an explicit resolution for arbitrary monomial ideals. Later, Lyubeznik found that a subcomplex already defines a resolution. We show that the Taylor resolution may be obtained by repeated application of the Schreyer Theorem from the theory of Groebner bases, whereas the Lyubeznik resolution is a consequence of Buchberger's chain criterion. Finally, we relate Froeberg's contracting homotopy for the Taylor complex to normal forms with respect to our Groebner bases and use it to derive a splitting homotopy that leads to the Lyubeznik complex.
机译:泰勒为任意单项式理想提出了明确的解决方案。后来,吕贝尼克(Lyubeznik)发现亚复合物已经定义了分辨率。我们表明泰勒分辨率可以通过从格罗布纳基础理论中重复应用施雷尔定理获得,而吕贝克尼克分辨率是布赫伯格链准则的结果。最后,我们将弗洛伯格对于泰勒复合体的收缩同构与关于我们Groebner碱基的正常形式联系起来,并用它来得出导致Lyubeznik复合体的分裂同构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号