Search Results for ""
721 - 730 of 1443 for Decomposition GroupSearch Results
The plane figure formed by a sequence of circles C_1, C_2, C_3, ... that are all tangent to each other at the same point and such that the sequence of radii converges to ...
The lower central series of a Lie algebra g is the sequence of subalgebras recursively defined by g_(k+1)=[g,g_k], (1) with g_0=g. The sequence of subspaces is always ...
Symbols used to identify irreducible representations of groups: A= singly degenerate state which is symmetric with respect to rotation about the principal C_n axis, B= singly ...
One of the set of symbols C_i, C_s, C_1, C_2, C_3, C_4, C_5, C_6, C_7, C_8, C_(2h), C_(3h), C_(4h), C_(5h), C_(6h), C_(2v), C_(3v), C_(4v), C_(5v), C_(6v), C_(inftyv), D_2, ...
A Lie algebra g is solvable when its Lie algebra commutator series, or derived series, g^k vanishes for some k. Any nilpotent Lie algebra is solvable. The basic example is ...
The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...
A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...
Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...
Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...
Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...
...
View search results from all Wolfram sites (16778 matches)

