Search Results for ""

For any alpha in A (where A denotes the set of algebraic numbers), let |alpha|^_ denote the maximum of moduli of all conjugates of alpha. Then a function ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A fact noticed by physicist G. Gamow when he had an office on the second floor and physicist M. Stern had an office on the sixth floor of a seven-story building (Gamow and ...

In mathematics, a small positive infinitesimal quantity, usually denoted epsilon or epsilon, whose limit is usually taken as epsilon->0. The late mathematician P. Erdős also ...

A number n is called equidigital if the number of digits in the prime factorization of n (including powers) uses the same number of digits as the number of digits in n. The ...

The equilateral cevian triangle point of a triangle is the unique point P such that the Cevian triangle of P is equilateral. This point is Kimberling center X_(370).

p is an equireciprocal point if, for every chord [x,y] of a curve C, p satisfies |x-p|^(-1)+|y-p|^(-1)=c for some constant c. The foci of an ellipse are equichordal points.

Two metrics g_1 and g_2 defined on a space X are called equivalent if they induce the same metric topology on X. This is the case iff, for every point x_0 of X, every ball ...

A conjecture due to Paul Erdős and E. G. Straus that the Diophantine equation 4/n=1/a+1/b+1/c involving Egyptian fractions always can be solved (Obláth 1950, Rosati 1954, ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...