Search Results for ""

A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).

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), ...

Let a triangle have angles A, B, and C, then inequalities include sinA+sinB+sinC<=3/2sqrt(3) (1) 1<=cosA+cosB+cosC<=3/2 (2) sin(1/2A)sin(1/2B)sin(1/2C)<=1/8 (3) ...

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 ...

Let f(x) be a finite and measurable function in (-infty,infty), and let epsilon be freely chosen. Then there is a function g(x) such that 1. g(x) is continuous in ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...