> ^ From:

> ^ Subject:

Hello,

I am developping a library for computing in invariant rings of

permutations groups. So far, I am using MuPAD for this, but I am

currently rewritting some parts in C++, and may as well use this

occasion to switch to Gap for the rest. I spent the afternoon browsing

through the manual, and it seems that about all the features I need

are available (plus plenty of new ones!).

I have a few questions regarding this:

- are there any benchmarks for comparing the speed of basic

manipulations of polynomials between MuPAD and Gap

- are there functions in gap to compute series expansions of rational

functions ?

- is the Polya enumeration implemented ? (Consider the action of a

permutation group on lists containing elements with given weights,

and compute the generating series of the orbits).

Thanks in advance,

Best regards, Nicolas -- Nicolas M. Thiéry "Isil", 412 Washington Avenue, 80403 Golden Colorado (USA) Mél: nthiery@mines.edu, Tél: (303)273-5492, Fax: (303)273-3875 WWW: <URL:http://www.mines.edu/~nthiery/>

> < [top]