序列关系的结构理想的Gr{<$}bner基的猜测
Guessing Gr{ö}bner Bases of Structured Ideals of Relations of Sequences
摘要:
假设一个域上定义的n维表中有足够多的项,我们的目标是猜测它们满足的具有常数或多项式系数的线性递归关系。在许多应用中,表项伴随着一个结构:例如,它们可能在锥外为零,它们可能在有限群作用下从理想不变量的Gr{<$}bner基构建。因此,我们展示了如何利用这种结构来减少表查询的数量和基本字段中的操作数量,以恢复表的理想关系。在像组合数学这样的应用中,所有这些零项使我们猜测许多假关系,这使我们能够大大减少这些错误的猜测。这些算法已经实现,并且在实验上,它们让我们处理我们无法管理的示例。此外,我们证明了哪种锥和格结构被保留的斜多项式乘法。这使得我们可以通过计算斜多项式环中有限群作用下的理想不变量的稀疏Gr{<$}bner基或Gr{<$}bner基来加快多项式系数的线性递归关系的猜测。
英文摘要:
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms come along with a structure: for instance, they may be zero outside of a cone, they may be built from a Gr{ö}bner basis of an ideal invariant under the action of a finite group. Thus, we show how to take advantage of this structure to both reduce the number of table queries and the number of operations in the base field to recover the ideal of relations of the table. In applications like in combinatorics, where all these zero terms make us guess many fake relations, this allows us to drastically reduce these wrong guesses. These algorithms have been implemented and, experimentally, they let us handle examples that we could not manage otherwise. Furthermore, we show which kind of cone and lattice structures are preserved by skew polynomial multiplication. This allows us to speed up the guessing of linear recurrence relations with polynomial coefficients by computing sparse Gr{ö}bner bases or Gr{ö}bner bases of an ideal invariant under the action of a finite group in a ring of skew polynomials.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。