Search Results for ""

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 ...

The probability that two elements P_1 and P_2 of a symmetric group generate the entire group tends to 3/4 as n->infty (Netto 1964, p. 90). The conjecture was proven by Dixon ...

A non-Abelian group, also sometimes known as a noncommutative group, is a group some of whose elements do not commute. The simplest non-Abelian group is the dihedral group ...

A set X is said to be nowhere dense if the interior of the set closure of X is the empty set. For example, the Cantor set is nowhere dense. There exist nowhere dense sets of ...

Numerical differentiation is the process of finding the numerical value of a derivative of a given function at a given point. In general, numerical differentiation is more ...

A univariate function f(x) is said to be odd provided that f(-x)=-f(x). Geometrically, such functions are symmetric about the origin. Examples of odd functions include x, ...

The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...

A property that is always fulfilled by the product of topological spaces, if it is fulfilled by each single factor. Examples of productive properties are connectedness, and ...

Given a subset S subset R^n and a real function f which is Gâteaux differentiable at a point x in S, f is said to be pseudoconvex at x if del f(x)·(y-x)>=0,y in ...

The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.