Search Results for ""

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

The number of nondecreasing lists {a_1,a_2,...,a_n} consisting of n elements 1<=a_i<=k is given by the binomial coefficient N(n,k)=(n+k-1; n-1). For example, there are six ...

AW, AB, and AY in the above figure are in a harmonic range.

A Möbius strip with finite thickness.

A group action of a topological group G on a topological space X is said to be a proper group action if the mapping G×X->X×X(g,x)|->(gx,x) is a proper map, i.e., inverses of ...

A three-dimensional coordinate system in which the axes satisfy the right-hand rule.

One of the straight lines sweeping out a ruled surface. The rulings on a ruled surface are asymptotic curves.

A topological space having a countable dense subset. An example is the Euclidean space R^n with the Euclidean topology, since it has the rational lattice Q^n as a countable ...

A root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...