Search Results for ""

Geometry

Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...

There are four completely different definitions of the so-called Apollonius circles: 1. The set of all points whose distances from two fixed points are in a constant ratio ...

Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

The word configuration is sometimes used to describe a finite collection of points p=(p_1,...,p_n), p_i in R^d, where R^d is a Euclidean space. The term "configuration" also ...

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

An n-step Fibonacci sequence {F_k^((n))}_(k=1)^infty is defined by letting F_k^((n))=0 for k<=0, F_1^((n))=F_2^((n))=1, and other terms according to the linear recurrence ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...