|
|
|
last edited 17 years ago |
Edit detail for AbstractFauser2007 revision 1 of 1
| 1 | ||
|
Editor: 127.0.0.1
Time: 2007/11/10 00:22:47 GMT-8 |
||
| Note: | ||
changed: - Calculations in character Hopf algebras using SCHUR and Maple Symmetric functions provide a tool for computations in invariant theory and especially for group characters. Recently, developments in Hopf algebra have pushed forward these technologies to cope with a wide class of subgroups of $GL(n)$. To be able to provide examples computer algebra computations are inevitable due to the inherent combinatorial complexity of the problem. We describe how "SCHUR (B.G. Wybourne et al.)":http://smc.vnet.net/Schur.html was used to compute characters of non-semisimple groups and what its benefits and deficiencies are. Furthermore we discuss the Maple package "SchurFkt (R. Ablamowicz, B. Fauser)":http://clifford.physik.uni-konstanz.de/~fauser/pg/CA.shtml#schurfkt which was designed to provide a proof-of-concept approach for new algorithms. Problems with data structures, efficiency etc. will be addressed.
Calculations in character Hopf algebras using SCHUR and Maple
Symmetric functions provide a tool for computations in invariant
theory and especially for group characters. Recently, developments in Hopf algebra
have pushed forward these technologies to cope with a wide class of subgroups of
. To be able to provide examples computer algebra computations are
inevitable due to the inherent combinatorial complexity of the problem. We
describe how SCHUR (B.G. Wybourne et al.)
was used to compute characters of non-semisimple groups and what its benefits
and deficiencies are. Furthermore we discuss the Maple package
SchurFkt? (R. Ablamowicz, B. Fauser)
which was designed to provide a proof-of-concept approach for new algorithms.
Problems with data structures, efficiency etc. will be addressed.