首页> 外文会议>Annual symposium on Computational geometry;Symposium on Computational geometry >Degree complexity bounds on the intersection of algebraic curves
【24h】

Degree complexity bounds on the intersection of algebraic curves

机译:代数曲线的交点上的度复杂度范围

获取原文

摘要

The intersection of algebraic curves in three and higher dimensional spaces is considered. An algebrogeometric technique is developed for obtaining an upper bound on the number of intersection points of two irreducible algebraic curves. The asymptotic bounds are shown to be a function of only the degrees of the two intersecting curves. Some specific examples involving curves in 3-space are analyzed.

机译:

考虑了三维空间中的代数曲线的交点。为了获得两个不可约代数曲线的交点数目的上限,开发了一种代数几何技术。渐近边界显示为仅是两条相交曲线的度数的函数。分析了一些涉及3维曲线的具体例子。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号