...
首页> 外文期刊>Journal of symbolic computation >Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm
【24h】

Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm

机译:利用Buchberger算法计算有限生成k代数中理想的限制

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

获取外文期刊封面封底 >>

       

摘要

Groebner bases can be used to solve various algorithmic problems in the context of finitely generated field extensions. One key idea is the computation of a certain kind of restriction of an ideal to a subring. With this restricted ideal many problems concerning function fields reduce to ideal theoretic problems which can be solved by means of Buchberger's algorithm. In this contribution this approach is generalized to allow the computation of the restriction of an arbitrary ideal to a subring.
机译:在有限生成的字段扩展范围内,Groebner基础可用于解决各种算法问题。一个关键的想法是计算理想对子环的某种限制。有了这个受限制的理想,有关功能场的许多问题都简化为理想的理论问题,可以通过布赫伯格算法来解决。在这一贡献中,该方法被概括为允许计算任意理想对子环的限制。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号