Search Results for ""

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

If an infinite number of points in the plane are all separated by integer distances, then all the points lie on a straight line.

A sequence {a_1,a_2,a_3,...} fulfils a given property eventually if it fulfils it from some point onward, or, more precisely, if the property is fulfilled by the subsequence ...

Fatou dust is a Fatou set for a point outside the underlying set. Such a set has zero area and has an infinite number of disconnected components.

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

The infimum of all number a for which |f(z)|<=exp(|z|^a) holds for all |z|>r and f an entire function, is called the order of f, denoted lambda=lambda(f) (Krantz 1999, p. ...

The Goffinet dragon is the fractal obtained by plotting all points spanned by powers of the complex number p=0.65-0.3i (Trott 2004, p. 9).

The greatest dividing exponent gde(n,b) of a base b with respect to a number n is the largest integer value of k such that b^k|n, where b^k<=n. It is implemented as the ...

The set of sums sum_(x)a_xx ranging over a multiplicative group and a_i are elements of a field with all but a finite number of a_i=0. Group rings are graded algebras.