Search Results for ""

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

A map projection given by the following transformation, x = lambda-lambda_0 (1) y = 5/4ln[tan(1/4pi+2/5phi)] (2) = 5/4sinh^(-1)[tan(4/5phi)]. (3) Here, x and y are the plane ...

The Mills ratio is defined as m(x) = 1/(h(x)) (1) = (S(x))/(P(x)) (2) = (1-D(x))/(P(x)), (3) where h(x) is the hazard function, S(x) is the survival function, P(x) is the ...

The group Gamma of all Möbius transformations of the form tau^'=(atau+b)/(ctau+d), (1) where a, b, c, and d are integers with ad-bc=1. The group can be represented by the 2×2 ...

Given a random variable x and a probability density function P(x), if there exists an h>0 such that M(t)=<e^(tx)> (1) for |t|<h, where <y> denotes the expectation value of y, ...

Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...

Given a sequence {a_i}_(i=1)^N, an n-moving average is a new sequence {s_i}_(i=1)^(N-n+1) defined from the a_i by taking the arithmetic mean of subsequences of n terms, ...

Murata's constant is defined as C_(Murata) = product_(p)[1+1/((p-1)^2)] (1) = 2.82641999... (2) (OEIS A065485), where the product is over the primes p. It can also be written ...

Let a spherical triangle have sides a, b, and c with A, B, and C the corresponding opposite angles. Then (sin[1/2(A-B)])/(sin[1/2(A+B)]) = (tan[1/2(a-b)])/(tan(1/2c)) (1) ...