TOPICS
Search

Search Results for ""


151 - 160 of 371 for Permutation combinationsSearch Results
The dimension d of any irreducible representation of a group G must be a divisor of the index of each maximal normal Abelian subgroup of G. Note that while Itô's theorem was ...
A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...
A generalization of the concept of set unions and intersections.
A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...
Let Y^X be the set of continuous mappings f:X->Y. Then the topological space for Y^X supplied with a compact-open topology is called a mapping space.
If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...
A set-like object in which order is ignored, but multiplicity is explicitly significant. Therefore, multisets {1,2,3} and {2,1,3} are equivalent, but {1,1,2,3} and {1,2,3} ...
Any irreducible curve may be carried by a factorable Cremona transformation into one with none but ordinary singular points.
An 18-sided polygon, sometimes also called an octakaidecagon.
The central point (r=0) in polar coordinates, or the point with all zero coordinates (0, ..., 0) in Cartesian coordinates. In three dimensions, the x-axis, y-axis, and z-axis ...
1 ... 13|14|15|16|17|18|19 ... 38 Previous Next

...