首页> 外文会议>Proceedings of the 36th international symposium on symbolic and algebraic computation. >An Algorithm for Computing Set-Theoretic Generators of an Algebraic Variety
【24h】

An Algorithm for Computing Set-Theoretic Generators of an Algebraic Variety

机译:计算代数集合论生成器的算法

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

摘要

Based on Eisenbud's idea (see [Eisenbud, D., Evans, G., 1973. Every algebraic set in n-space is the intersection of n hypersurfaces. Invent. Math. 19, 107-112]), we present an algorithm for computing set-theoretic generators for any algebraic variety in the affine n-space, which consists of at most n polynomials. With minor modifications, this algorithm is also valid for projective algebraic variety in projec-tive n-space.
机译:基于Eisenbud的想法(请参阅[Eisenbud,D.,Evans,G.,1973。n空间中的每个代数集都是n个超曲面的交点。Invent。Math。19,107-112]),我们提出了一种算法计算仿射n空间中最多由n个多项式组成的任何代数变体的集合理论生成器。稍作修改,该算法也适用于射影n空间中的投影代数变体。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号