| |
| | CPC Licence Alert (Site not responding. Last check: 2007-11-07) |
 | | The inner multiplicity of a particular weight in a given representation, characterised by the highest weight, can be found by counting all distinct Gelfand patterns which belong to the same weight. |
 | | The multiplicity Gamma(0,0,0,0,0)=5 is the representation D(1,1,0,-1,-1) is calculated in.31 s by Honeywell computer and in 20 s by the micro computer. |
 | | The multiplicity Gamma(0,0,0,0,0,0,0,0,0,0)=90 in the representation D(1,1,1,1,0,0,-1,-1,-1,-1) is calculated in 1.6 s by Honeywell computer and 295 s by the micro computer. |
| www.cpc.cs.qub.ac.uk /summaries/AATL.html (246 words) |
|