计算二元形式不变量的Poincaré级数的启发式算法
A heuristic algorithm for computing the Poincaré series of the invariants of binary forms
摘要：
我们提出了一个启发式算法的快速计算的庞加莱系列$P_n(t)$的不变量的二进制形式的程度$n$，视为有理函数。该算法是基于某些多项式的身份，仍有待严格证明。用它计算了$n\le30$的$P_n(t)$。
英文摘要：
We propose a heuristic algorithm for fast computation of the Poincaré series $P_n(t)$ of the invariants of binary forms of degree $n$, viewed as rational functions. The algorithm is based on certain polynomial identities which remain to be proved rigorously. By using it, we have computed the $P_n(t)$ for $n\le30$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
