Search Results for ""

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

The Barnes G-function is an analytic continuation of the G-function defined in the construction of the Glaisher-Kinkelin constant G(n)=([Gamma(n)]^(n-1))/(H(n-1)) (1) for ...

Given a subset A of a larger set, the characteristic function chi_A, sometimes also called the indicator function, is the function defined to be identically one on A, and is ...

A free idempotent monoid is a monoid that satisfies the identity x^2=x and is generated by a set of elements. If the generating set of such a monoid is finite, then so is the ...

The first theorem of Pappus states that the surface area S of a surface of revolution generated by the revolution of a curve about an external axis is equal to the product of ...

Let f(z) be an analytic function in |z-a|<R. Then f(z)=1/(2pi)int_0^(2pi)f(z+re^(itheta))dtheta for 0<r<R.

A word or string which is not admissible.

A sampling phenomenon produced when a waveform is not sampled uniformly at an interval t each time, but rather at a series of slightly shifted intervals t+Deltat_i such that ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...