Realization of decompositions of algebraic structures on real computer

代数结构分解在真实计算机上的实现

• 批准号: 15340011
• 负责人: YOKOYAMA Kazuhiro
• 金额: $ 4.54万
• 依托单位: Rikkyo University (2005)Kyushu University (2003-2004)
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (B)
• 财政年份: 2003
• 资助国家: 日本
• 起止时间: 2003 至 2005
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-15340011/
• 关键词: Computer Algebra; Groebner Base; Computer Assisted Proof; Computer Algebra System; Splitting Field; Quantifier Elimination; Numeric-Symbolic Computation; Vertex Operator Algebra; 記号・代数計算; 代数制約解法; Groebner基底; 不等式制約解法; パラメトリックシステム; Galois群計算

The goal of the project consists of two aims : The first aim is to examine how high/deep mathematical operations on algebraic structures can be executed on real computer by concentrating on decompositions of algebraic structures. Using symbolic and algebraic computation, we try to realize the mathematical operations related to "decomposition". The second one is to utilize realized operations for studies on mathematics as computational tools. The realized mathematical operations on computer shall support mathematicians to investigate unsolved problems and it can produce certain computer-assisted-proofs. Extending the ability of such computations, we apply those to real engineering problems. For those aims, we selected a number of themes, for which we developed effective/efficient algorithms, implemented those, and examined their ability on computational experiments. We have obtained satisfactory results and found promising approaches for realization of more higher/deeper mathematical op … More erations. We list themes and give details for each :(1)Commutative Algebra :For prime decomposition of polynomial ideals over finite fields, we obtained an efficient algorithm and its practical implementation. For polynomial ideals with parametric exponents, we defined certain stability of those ideals based on "forms of Groebner bases", and gave a complete algorithm for deciding such stability for simpler cases. We applied "numeric-symbolic computation" to the CAD algorithm for quantifier elimination.(2)Commutative Algebra with High Symmetry :We obtained a practical method for computing the splitting field of a polynomial with rational coefficients by using p-adic approximations of its roots and information of its Galois group.(3)Non-Commutative Algebra :We obtained a computer-assisted-proof in classification of irreducible modules of the vertex operator algebra derived from a lattice.(4)Supports for Mathematics and Engineering :We also obtained a computer-assisted-proof in solving an unsolved conjecture related algebraic curves, and we also applied Groebner bases technique successfully to problems in control theory. Less

该项目的目标包括两个目标：第一个目标是检验如何通过集中于代数结构的分解来在真实计算机上执行对代数结构的高/深数学运算。利用符号运算和代数运算，我们尝试实现与“分解”相关的数学运算。二是利用已实现的运算进行数学研究，作为计算工具。在计算机上实现的数学运算将支持数学家研究未解决的问题，并能产生一定的计算机辅助证明。扩展了这种计算的能力，我们将其应用于实际的工程问题。为了实现这些目标，我们选择了一些主题，为这些主题开发了有效/高效的算法，实现了这些算法，并在计算实验中测试了它们的能力。我们得到了令人满意的结果，为实现更高/更深的数学运算…找到了有前途的方法更多的颂词。(1)交换代数：对于有限域上多项式理想的素数分解，我们得到了一个有效的算法及其实际实现。对于含参数指数的多项式理想，我们基于“Groebner基的形式”定义了这类理想的稳定性，并在更简单的情况下给出了判定这种稳定性的完整算法。(2)高对称性交换代数：利用有理系数多项式的根的p-进近似和Galois群的信息，得到了计算有理系数多项式分裂域的一种实用方法。(3)非交换代数：我们得到了由格导出的顶点算子代数的不可约模分类的计算机辅助证明。(4)对数学和工程的支持：我们还得到了解决与代数曲线有关的未解猜想的计算机辅助证明，并成功地将Groebner基技术应用于控制理论中的问题。较少

项目成果

離散戸田方程式を用いた大規模疎行列の連立一次方程式,行列式,固有多項式の計算法

使用离散Toda方程的大规模稀疏矩阵的联立线性方程、行列式和特征多项式的计算方法

• 发表时间: 2005
• 期刊: 日本応用数理学会論文誌 15(3)
• 作者: M. Granger;T. Oaku;N. Takayama;S.Iwamoto;Y.Kawano;Y.Yoshida;木村 欣司
• 通讯作者: 木村 欣司

Cylindrical algebraic decomposition via numerical computation with validated symbolic reconstruction

通过数值计算和经过验证的符号重建进行圆柱代数分解

• 发表时间: 2005
• 期刊: Algorithmic Algebra and Logic, Proceedings of the A3L 2005
• 作者: Hirokazu Anai;Kazuhiro Yokoyama
• 通讯作者: Kazuhiro Yokoyama

Dynamic Evaluation の実装について

关于实施动态评估

• 发表时间: 2005
• 期刊: 数式処理 11
• 作者: 木村欣司;野呂正行;辻本諭;中村佳正;野呂正行
• 通讯作者: 野呂正行

M.Noro, K.Yokoyama: "Implementation of prime decomposition of polynomial ideals over small finite fields"Journal of Symbolic Computation. (to appear). (2004)

M.Noro、K.Yokoyama：“小有限域上多项式理想素数分解的实现”符号计算杂志。

A modular method for computing the splitting field of a polynomial

计算多项式分裂域的模块化方法

• 发表时间: 2006
• 期刊: Algorithmic Number Theory, Proceedings of ANTS-VII, Lecture Notes in Computer Science 4076
• 作者: Gu□na□l Renault;Kazuhiro Yokoyama
• 通讯作者: Kazuhiro Yokoyama