Search Results for ""

A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

The fractal-like two-dimensional function f(x,y)=((x^2-y^2)sin((x+y)/a))/(x^2+y^2). The function is named for the appearance of a butterfly-like pattern centered around the ...

The Owen T-function is defined as T(x,a)=1/(2pi)int_0^a(e^(-x^2(1+t^2)/2))/(1+t^2)dt. It is implemented in the Wolfram Language as OwenT[x, a]. A special value is given by ...

The pathological function f_a(x)=sum_(k=1)^infty(sin(pik^ax))/(pik^a) (originally defined for a=2) that is continuous but differentiable only on a set of points of measure ...

The apodization function A(x)=1-(x^2)/(a^2). (1) Its full width at half maximum is sqrt(2)a. Its instrument function is I(k) = 2asqrt(2pi)(J_(3/2)(2pika))/((2pika)^(3/2)) (2) ...

The space of continuously differentiable functions is denoted C^1, and corresponds to the k=1 case of a C-k function.

By analogy with the geometric centroid, the centroid of an arbitrary function f(x) is defined as <x>=(intxf(x)dx)/(intf(x)dx), (1) where the integrals are taken over the ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...