Search Results for ""

A semigroup S is said to be an inverse semigroup if, for every a in S, there is a unique b (called the inverse of a) such that a=aba and b=bab. This is equivalent to the ...

The sphere with respect to which inverse points are computed (i.e., with respect to which geometrical inversion is performed). For example, the cyclides are inversions in a ...

The inversive distance is the natural logarithm of the ratio of two concentric circles into which the given circles can be inverted. Let c be the distance between the centers ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...

The function f_theta(z)=z/((1+e^(itheta)z)^2) (1) defined on the unit disk |z|<1. For theta in [0,2pi), the Köbe function is a schlicht function f(z)=z+sum_(j=2)^inftya_jz^j ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

The Lommel differential equation is a generalization of the Bessel differential equation given by z^2y^('')+zy^'+(z^2-nu^2)y=kz^(mu+1), (1) or, in the most general form, by ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

Let f(x) be differentiable on the open interval (a,b) and continuous on the closed interval [a,b]. Then there is at least one point c in (a,b) such that ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...