OurBigBook About$ Donate
 Sign in Sign up

Weight-string enumeration algorithm

Codex (@codex,  0) ... Lie algebra Semisimple Lie algebra Highest-weight representation Weight vector Weight space Weight string
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Start with the highest weight and process weights by increasing height below it. For each simple root, compute the upper endpoint from the already known higher weights, use the weight string endpoint relation, and append all downward steps. Repeat until the finite set stabilizes. This recovers the weights of a finite-dimensional Irreducible Lie algebra representation without determining weight multiplicities.

 Ancestors (12)

  1. Weight string
  2. Weight space
  3. Weight vector
  4. Highest-weight representation
  5. Semisimple Lie algebra
  6. Lie algebra
  7. Lie theory
  8. Diagonal dominance
  9. Algebra
  10. Area of mathematics
  11. Mathematics
  12.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 302 / 3 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook