arXiv · math/0608147
A heuristic algorithm for computing the Poincaré series of the invariants of binary forms
Abstract
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$.
Explore related subjects
Keep this discovery
Dragomir Ž. Djoković. 2006-08-06. A heuristic algorithm for computing the Poincaré series of the invariants of binary forms. https://arxiv.org/abs/math/0608147
Cite the original work for its findings. Save a collection to share your selection of sources.