Search Results for ""

The continued fraction for mu is given by [1; 2, 4, 1, 1, 1, 3, 1, 1, 1, 2, 47, 2, ...] (OEIS A099803). The positions at which the numbers 1, 2, ... occur in the continued ...

The spherical Bessel function of the second kind, denoted y_nu(z) or n_nu(z), is defined by y_nu(z)=sqrt(pi/(2z))Y_(nu+1/2)(z), (1) where Y_nu(z) is a Bessel function of the ...

The standard form of a line in the Cartesian plane is given by ax+by=c for real numbers a,b,c in R. This form can be derived from any of the other forms (point-slope form, ...

Stanley and Wilf conjectured (Bona 1997, Arratia 1999), that for every permutation pattern sigma, there is a constant c(sigma)<infty such that for all n, ...

A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers. If s_n(x) is an associated ...

For what value of x is f(x)=x^(1/x) a maximum? The maximum occurs at x=e, where f^'(x)=x^(-2+1/x)(1-lnx)=0, (1) which is zero at x=e and gives a maximum of ...

Polynomials S_k(x) which form the Sheffer sequence for g(t) = e^(-t) (1) f^(-1)(t) = ln(1/(1-e^(-t))), (2) where f^(-1)(t) is the inverse function of f(t), and have ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...