Back to Results
First PageMeta Content



Gerhard Hiss Algorithms of Representation Theory This article is published as Section 2.8 in the book: J. Grabmeier, E. Kaltofen, and V. Weispfenning (Eds.), Computer Algebra Handbook, Springer 2003, pp. 84–88.
Add to Reading List

Document Date: 2004-05-04 12:26:38

Open Document

File Size: 119,78 KB

Share Result on Facebook

City

Berlin / Pittsburgh / Stuttgart / Birmingham / New York / Durham / Paris / Oxford / /

Company

GAP Group / Weyl / Wilson / Cambridge University Press / Norton / Atlas / Clarendon Press / /

Country

Germany / Scotland / /

IndustryTerm

supersolvable / purpose systems / soluble quotient algorithm / symmetric groups / inner products / scalar products / computational / orbit algorithm / computing / tensor products / presented groups / finite / finite groups / recent applications / sporadic / /

Organization

Cambridge University / Virginia Tech / School of Mathematical and Computational Sciences / /

Person

Andrew Mathas / T. Gabrysch / Jon Carlson / Richard Parker / John Stembridge / M. D. Atkinson / Gerhard Hiss Algorithms / Augustinus Buchhandlung / David Green / Derek Holt / Gerhard Hiss (Aachen) / Sebastian Veigneau / B. Fischer / Gregor Kemper / Gordon James / /

Position

editor / /

ProvinceOrState

New York / /

Technology

quotient Algorithms / orbit algorithm / Av / soluble quotient algorithm / Zassenhaus algorithm / Gauß algorithm / 2.8 Algorithms / condensation / /

URL

http /

SocialTag