Search Results for ""

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...

The equation x^p=1, where solutions zeta_k=e^(2piik/p) are the roots of unity sometimes called de Moivre numbers. Gauss showed that the cyclotomic equation can be reduced to ...

A cyclotomic field Q(zeta) is obtained by adjoining a primitive root of unity zeta, say zeta^n=1, to the rational numbers Q. Since zeta is primitive, zeta^k is also an nth ...

The cylinder function is defined as C(x,y)={1 for sqrt(x^2+y^2)<=a; 0 for sqrt(x^2+y^2)>a. (1) The Bessel functions are sometimes also called cylinder functions. To find the ...

The map projection having transformation equations x = (lambda-lambda_0)cosphi_1 (1) y = phi, (2) and the inverse formulas are phi = y (3) lambda = lambda_0+xsecphi_1, (4) ...

Darboux's formula is a theorem on the expansion of functions in infinite series and essentially consists of integration by parts on a specific integrand product of functions. ...

A function f(x) decreases on an interval I if f(b)<=f(a) for all b>a, where a,b in I. If f(b)<f(a) for all b>a, the function is said to be strictly decreasing. Conversely, a ...

A subspace A of X is called a deformation retract of X if there is a homotopy F:X×I->X (called a retract) such that for all x in X and a in A, 1. F(x,0)=x, 2. F(x,1) in A, ...

A limiting case in which a class of object changes its nature so as to belong to another, usually simpler, class. For example, the point is a degenerate case of the circle as ...