Are you seeking a representation by finite matrices over the reals? How do you know that a representation of the desired type exists? Any proof of existence for the groups you're interested in would probably implicitly provide an algorithm for construction, though the dimension might be impracticably large: cf. the standard proof for the finite order case. Or if you have a reflection group, presumably you can just pull up a subgroup of the appropriate Lie group: there are online tables of such things. [This is not an area in which I can claim any special expertise: maybe somebody else out there can cast more light?] WFL On 11/28/12, Mike Stay <metaweta@gmail.com> wrote:
Given a presentation of a Coxeter group with n generators, what's the most straightforward algorithm for producing a set of n matrices that satisfy the same relations?
-- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun