Simplifying Expressions Involving Radicals
... the simplification of expressions. Since many algorithms in Computer Algebra systems like Mathematica, Maple, and Reduce work in quite general settings they do not necessarily find a solution to a given problem described in the easiest possible way. Simplification algorithms can be applied to expres ...
... the simplification of expressions. Since many algorithms in Computer Algebra systems like Mathematica, Maple, and Reduce work in quite general settings they do not necessarily find a solution to a given problem described in the easiest possible way. Simplification algorithms can be applied to expres ...
skew-primitive elements of quantum groups and braided lie algebras
... where H is a braided graded Hopf algebra over a commutative group G [L, Ma, R, S]. In this situation the primitive elements of H are skew-primitive elements of L. So the structure of a braided Lie algebra on the set of primitive elements in H induces a similar structure on a subset of the skew-primi ...
... where H is a braided graded Hopf algebra over a commutative group G [L, Ma, R, S]. In this situation the primitive elements of H are skew-primitive elements of L. So the structure of a braided Lie algebra on the set of primitive elements in H induces a similar structure on a subset of the skew-primi ...
Root of unity
In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that gives 1 when raised to some positive integer power n. Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform.In field theory and ring theory the notion of root of unity also applies to any ring with a multiplicative identity element. Any algebraically closed field has exactly n nth roots of unity, if n is not divisible by the characteristic of the field.