Search Results for ""

Let h:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) be efficiently computable by an algorithm (solving a P-problem). For fixed y in {0,1}^(l(n)), view h(x,y) as a function h_y(x) of x ...

The Hurwitz zeta function zeta(s,a) is a generalization of the Riemann zeta function zeta(s) that is also known as the generalized zeta function. It is classically defined by ...

A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...

Given a nonzero finitely generated module M over a commutative Noetherian local ring R with maximal ideal M and a proper ideal I of R, the Hilbert-Samuel function of M with ...

A function f(x) is logarithmically convex on the interval [a,b] if f>0 and lnf(x) is convex on [a,b]. If f(x) and g(x) are logarithmically convex on the interval [a,b], then ...

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...

The harmonic conjugate to a given function u(x,y) is a function v(x,y) such that f(x,y)=u(x,y)+iv(x,y) is complex differentiable (i.e., satisfies the Cauchy-Riemann ...

The central beta function is defined by beta(p)=B(p,p), (1) where B(p,q) is the beta function. It satisfies the identities beta(p) = 2^(1-2p)B(p,1/2) (2) = ...

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is 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 ...