arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1602.00296math.RAcs.SCmath.OA
收藏

G-代数的因子分解算法及其应用

A Factorization Algorithm for G-Algebras and Applications

Albert Heinle, Viktor Levandovskyy

摘要:

Bell,Heinle和Levandovskyy最近发现了一类代数,包括普遍存在的$G$ -代数,都是有限因子分解域(FFD).利用这一结果,我们贡献了一个算法,找到所有不同的分解的一个给定的元素$f \in \mathcal{G}$,其中$\mathcal{G}$是任何$G$ -代数,与小的假设基础领域。此外,作为一个FFD的属性,结合因子分解算法,使我们能够提出一个类似的描述的因子分解Gröbner基算法的$G$ -代数。该算法适用于各种应用,例如分析由$\mathcal{G}$导出的多项式系数线性偏函数方程组的解空间。另外,可以在输入中包括理想的不等式约束。

英文摘要:

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to find all distinct factorizations of a given element $f \in \mathcal{G}$, where $\mathcal{G}$ is any $G$-algebra, with minor assumptions on the underlying field. Moreover, the property of being an FFD, in combination with the factorization algorithm, enables us to propose an analogous description of the factorized Gröbner basis algorithm for $G$-algebras. This algorithm is useful for various applications, e.g. in analysis of solution spaces of systems of linear partial functional equations with polynomial coefficients, coming from $\mathcal{G}$. Additionally, it is possible to include inequality constraints for ideals in the input.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑