A heuristic algorithm for computing the Poincar\'e series of the invariants of binary forms
Abstract
We propose a heuristic algorithm for fast computation of the Poincar\'e series Pn(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 Pn(t) for n30.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.