Search Results for ""

Let C_(L,M) be a Padé approximant. Then C_((L+1)/M)S_((L-1)/M)-C_(L/(M+1))S_(L/(M+1)) = C_(L/M)S_(L/M) (1) C_(L/(M+1))S_((L+1)/M)-C_((L+1)/M)S_(L/(M+1)) = ...

The solution to a game in game theory. When a game saddle point is present max_(i<=m)min_(j<=n)a_(ij)=min_(j<=n)max_(i<=m)a_(ij)=v, and v is the value for pure strategies.

An arc of a graph, sometimes also called a flag, is an ordered pair of adjacent vertices (Godsil and Royle 2001, p. 59), sometimes also called a directed line (Harary 1994, ...

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

The kernel of a group homomorphism f:G-->G^' is the set of all elements of G which are mapped to the identity element of G^'. The kernel is a normal subgroup of G, and always ...

A group representation of a group G on a vector space V can be restricted to a subgroup H. For example, the symmetric group on three letters has a representation phi on R^2 ...

A theorem proved by É. Cartan in 1913 which classifies the irreducible representations of complex semisimple Lie algebras.

The homeomorphism group of a topological space X is the set of all homeomorphisms f:X->X, which forms a group by composition.

The central point in a wheel graph W_n. The hub has degree n-1.

A catastrophe which can occur for three control factors and two behavior axes. The hyperbolic umbilic is the universal unfolding of the function germ f(x,y)=x^3+y^3. The ...