Search Results for ""

Ergodic theory can be described as the statistical and qualitative behavior of measurable group and semigroup actions on measure spaces. The group is most commonly N, R, R-+, ...

The Euler-Maclaurin integration and sums formulas can be derived from Darboux's formula by substituting the Bernoulli polynomial B_n(t) in for the function phi(t). ...

Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

The Fox H-function is a very general function defined by where 0<=m<=q, 0<=n<=p, alpha_j,beta_j>0, and a_j,b_j are complex numbers such that no pole of Gamma(b_j-beta_js) for ...

Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...

A function is a relation that uniquely associates members of one set with members of another set. More formally, a function from A to B is an object f such that every a in A ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

The geometric distribution is a discrete distribution for n=0, 1, 2, ... having probability density function P(n) = p(1-p)^n (1) = pq^n, (2) where 0<p<1, q=1-p, and ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...