Search Results for ""

"Poincaré transformation" is the name sometimes (e.g., Misner et al. 1973, p. 68) given to what other authors (e.g., Weinberg 1972, p. 26) term an inhomogeneous Lorentz ...

The sinusoidal projection is an equal-area projection given by the transformation x = (lambda-lambda_0)cosphi (1) y = phi. (2) The inverse formulas are phi = y (3) lambda = ...

A t-(v,k,lambda) block design (abbreviated t-design) is an incidence structure of points and blocks such that the following hold: 1. There are v points, 2. Each block ...

For any function f:A->B (where A and B are any sets), the kernel (also called the null space) is defined by Ker(f)={x:x in Asuch thatf(x)=0}, so the kernel gives the elements ...

The smallest n for which a point x_0 is a periodic point of a function f so that f^n(x_0)=x_0. For example, for the function f(x)=-x, all points x have period 2 (including ...

The integral transform (Kf)(x)=int_0^infty((x-t)_+^(c-1))/(Gamma(c))_2F_1(a,b;c;1-t/x)f(t)dt, where Gamma(x) is the gamma function, _2F_1(a,b;c;z) is a hypergeometric ...

Morley's circle is the circumcircle of the first Morley triangle. Its center is the first Morley center, which has center function alpha_(356)=cos(1/3A)+2cos(1/3B)cos(1/3C), ...

The most common "sine integral" is defined as Si(z)=int_0^z(sint)/tdt (1) Si(z) is the function implemented in the Wolfram Language as the function SinIntegral[z]. Si(z) is ...

An iterated map is a map that is applied repeatedly to an object. The Wolfram Language function NestList[f, expr, n] gives a list of the results of iterating the function f n ...

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...