Timeline for Nilpotency of Lie Algebra from Structure Constants
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2016 at 13:17 | comment | added | YCor | They work in real/complex Lie algebra if you input algebraic constants, I guess... you have to compute some numbers in the subring generated by the constants and be able to determine whether these number are zero. There are some issues. Computations are made with some number of digits; if you can't predict beforehand the correct number of digits, you might compute a number to be zero by mistake because its first nonzero digit is too far. | |
| Feb 28, 2016 at 13:12 | comment | added | Dietrich Burde | I thought of algorithms given in the book, and implemented in "gap", which do work for real and complex Lie algebras. | |
| Feb 28, 2016 at 12:46 | comment | added | YCor | Note that an algorithm, in the implementation meaning, only makes sense if we start with a computable field. Talking of an algorithm for a Lie algebra with real or complex coefficients is senseless (how do you input a real number?). The efficiency of the algorithm, in particular, depends on two variables: the dimension, and the max of "lengths" of structure coefficients (though I'm not sure there a single notion of length, for say, coefficients in $\mathbb{Q}[t]$) | |
| Feb 28, 2016 at 12:38 | history | answered | Dietrich Burde | CC BY-SA 3.0 |