Search Results for ""

A reduction system is called finitely terminating (or Noetherian) if there are no infinite rewriting sequences. This property guarantees that any rewriting algorithm will ...

The first group isomorphism theorem, also known as the fundamental homomorphism theorem, states that if phi:G->H is a group homomorphism, then Ker(phi)⊴G and ...

The Fischer groups are the three sporadic groups Fi_(22), Fi_(23), and Fi_(24)^'. These groups were discovered during the investigation of 3-transposition groups. The Fischer ...

The forward difference is a finite difference defined by Deltaa_n=a_(n+1)-a_n. (1) Higher order differences are obtained by repeated operations of the forward difference ...

The frame bundle on a Riemannian manifold M is a principal bundle. Over every point p in M, the Riemannian metric determines the set of orthonormal frames, i.e., the possible ...

A friendly number is a number that is a member of a friendly pair or a higher-order friendly n-tuple. Numbers that are not friendly are said to be solitary. There are some ...

The second-order ordinary differential equation (1-x^2)y^('')-2(mu+1)xy^'+(nu-mu)(nu+mu+1)y=0 (1) sometimes called the hyperspherical differential equation (Iyanaga and ...

The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

For all integers n and nonnegative integers t, the harmonic logarithms lambda_n^((t))(x) of order t and degree n are defined as the unique functions satisfying 1. ...