中文

A heuristic algorithm for computing the Poincar\'e series of the invariants of binary forms

交换代数 2009-09-01 v1

摘要

We propose a heuristic algorithm for fast computation of the Poincar\'{e} series Pn(t)P_n(t) of the invariants of binary forms of degree nn, 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 Pn(t)P_n(t) for n30n\le30.

关键词

引用

@article{arxiv.math/0608147,
  title  = {A heuristic algorithm for computing the Poincar\'e series of the invariants of binary forms},
  author = {Dragomir Ž. Djoković},
  journal= {arXiv preprint arXiv:math/0608147},
  year   = {2009}
}

备注

11 pages, 1 table. To appear in Int. J. Contemp. Math. Sci. Vol. 1 (2006), 557-568