Features
- Provides a unified approach to the extension problem and the factorization problem
- Introduces the classifying complements problem as a sort of converse of the factorization problem; and in the case of groups it leads to a theoretical formula for computing the number of types of isomorphisms of all groups of finite order that arise from a minimal set of data
- Describes a way of classifying a certain class of finite Lie/Leibniz/Poisson/Jacobi/associative algebras etc. using flag structures
- Introduces new (non)abelian cohomological objects for all of the aforementioned categories
- As an application to the approach used for dealing with the classification part of the ES problem, the Galois groups associated with extensions of Lie algebras and associative algebras are described
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
- Choice Review, A. Misseldine, Southern Utah University