位置:成果数据库 > 期刊 > 期刊详情页
On functional decomposition of multivariate polynomials with differentiation and homogenization
  • ISSN号:1009-6124
  • 期刊名称:Journal of Systems Science and Complexity
  • 时间:0
  • 页码:329-347
  • 分类:O174.14[理学—数学;理学—基础数学] TP311.52[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]Beijing Electronic Science and Technology Institute, Beijing 100070, China., [2]KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China.
  • 相关基金:partially supported by a National Key Basic Research Project of China under Grant No. 2011CB302400;by a Grant from NSFC with Nos 60821002 and 10901156
  • 相关项目:微分、差分方程的Galois理论及求liouvillian解的算法研究
中文摘要:

<正>This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye,Dai,and Lam(1999) and were developed by Faugere,Perret(2006,2008,2009).The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homogenous polynomials can be computed using the algorithm with high probability.This solves a conjecture proposed by Ye,Dai,and Lam(1999).The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials.Finally,the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.

英文摘要:

This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye, Dai, and Lam (1999) and were developed by Faugere, Perret (2006, 2008, 2009). The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homoge- nous polynomials can be computed using the algorithm with high probability. This solves a conjecture proposed by Ye, Dal, and Lam (1999). The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials. Finally, the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.

同期刊论文项目
期刊论文 56 会议论文 22 获奖 17 专利 3
同项目期刊论文
期刊信息
  • 《系统科学与复杂性学报:英文版》
  • 主管单位:中国科学院
  • 主办单位:中国科学院系统科学研究所
  • 主编:
  • 地址:北京东黄城根北街16号
  • 邮编:100080
  • 邮箱:
  • 电话:010-62541831 62541834
  • 国际标准刊号:ISSN:1009-6124
  • 国内统一刊号:ISSN:11-4543/O1
  • 邮发代号:82-545
  • 获奖情况:
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国数学评论(网络版),德国数学文摘,荷兰文摘与引文数据库,美国工程索引,美国科学引文索引(扩展库),英国科学文摘数据库
  • 被引量:125