A heuristic algorithm for computing the Poincaré series of the invariants of binary forms

Details A heuristic algorithm for computing the Poincaré series of the invariants of binary forms A heuristic algorithm for computing the Poincaré series of the invariants of binary forms

2006-08-06

arxiv.org/abs/math/0608147v1

Int. J. Contemp. Math. Sci. 1 (2006), no. 12, 557-568

Mathematics

Commutative Algebra

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

Scientific paper

We propose a heuristic algorithm for fast computation of the Poincar\'{e}
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$.

Affiliated with

Also associated with

No associations

Rating

A heuristic algorithm for computing the Poincaré series of the invariants of binary forms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A heuristic algorithm for computing the Poincaré series of the invariants of binary forms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A heuristic algorithm for computing the Poincaré series of the invariants of binary forms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394464