Search Results for ""

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...

Let S be a collection of subsets of a set X, mu:S->[0,infty] a set function, and mu^* the outer measure induced by mu. The measure mu^_ that is the restriction of mu^* to the ...

The Cesàro means of a function f are the arithmetic means sigma_n=1/n(s_0+...+s_(n-1)), (1) n=1, 2, ..., where the addend s_k is the kth partial sum ...

The chi distribution with n degrees of freedom is the distribution followed by the square root of a chi-squared random variable. For n=1, the chi distribution is a ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

A set of orthogonal functions {phi_n(x)} is termed complete in the closed interval x in [a,b] if, for every piecewise continuous function f(x) in the interval, the minimum ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...

The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...

The inverse Gaussian distribution, also known as the Wald distribution, is the distribution over [0,infty) with probability density function and distribution function given ...

Jonquière's relation, sometimes also spelled "Joncquière's relation" (Erdélyi et al. 1981, p. 31), states ...