Search Results for ""

In the study of non-associative algebra, there are at least two different notions of what the half-Bol identity is. Throughout, let L be an algebraic loop and let x, y, and z ...

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

The half-Moses circle is defined as the circle having the same center as the Moses circle, i.e., the Brocard midpoint X_(39) but half its radius, i.e., R_H = ...

The half-normal distribution is a normal distribution with mean 0 and parameter theta limited to the domain x in [0,infty). It has probability and distribution functions ...

An elliptic function can be characterized by its real and imaginary half-periods omega_1 and omega_2 (Whittaker and Watson 1990, p. 428), sometimes also denoted ...

tau is the ratio tau=omega_2/omega_1 of the two half-periods omega_1 and omega_2 of an elliptic function (Whittaker and Watson 1990, pp. 463 and 473) defined such that the ...

Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...

A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...

A root-finding algorithm also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order Taylor series ...

Given a set A, let N(A) be the set of neighbors of A. Then the bipartite graph G with bipartitions X and Y has a perfect matching iff |N(A)|>=|A| for all subsets A of X.