Search Results for ""

A subset of an algebraic variety which is itself a variety. Every variety is a subvariety of itself; other subvarieties are called proper subvarieties. A sphere of the ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

The taxicab metric, also called the Manhattan distance, is the metric of the Euclidean plane defined by g((x_1,y_1),(x_2,y_2))=|x_1-x_2|+|y_1-y_2|, for all points ...

A piecewise linear, one-dimensional map on the interval [0,1] exhibiting chaotic dynamics and given by x_(n+1)=mu(1-2|x_n-1/2|). (1) The first few iterations of (1) give x_1 ...

The trilogarithm Li_3(z), sometimes also denoted L_3, is special case of the polylogarithm Li_n(z) for n=3. Note that the notation Li_3(x) for the trilogarithm is ...

Over a small neighborhood U of a manifold, a vector bundle is spanned by the local sections defined on U. For example, in a coordinate chart U with coordinates (x_1,...,x_n), ...

A map f from a metric space M=(M,d) to a metric space N=(N,rho) is said to be uniformly continuous if for every epsilon>0, there exists a delta>0 such that ...

A distance graph with distance set (0,1].

For a second-order ordinary differential equation, y^('')+p(x)y^'+q(x)y=g(x). (1) Assume that linearly independent solutions y_1(x) and y_2(x) are known to the homogeneous ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...