Search Results for ""

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A multiplication * is said to be right distributive if (x+y)z=xz+yz for every x, y, and z. Similarly, it is said to be left distributive if z(x+y)=zx+zy for every x, y, and ...

A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...

The double sphere is the degenerate quartic surface (x^2+y^2+z^2-r^2)^2=0 obtained by squaring the left-hand side of the equation of a usual sphere x^2+y^2+z^2-r^2=0.

A Padé approximant perturbed with a Chebyshev polynomial of the first kind to reduce the leading coefficient in the error.

The Eisenstein units are the Eisenstein integers +/-1, +/-omega, +/-omega^2, where omega = 1/2(-1+isqrt(3)) (1) omega^2 = 1/2(-1-isqrt(3)). (2)

Elementary methods consist of arithmetic, geometry, and high school algebra. These are the only tools that may be used in the branch of number theory known as elementary ...

Elementary number theory is the branch of number theory in which elementary methods (i.e., arithmetic, geometry, and high school algebra) are used to solve equations with ...

The real projective plane with elliptic metric where the distance between two points P and Q is defined as the radian angle between the projection of the points on the ...