Search Results for ""

A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...

The regular hexagon is the regular polygon with six sides, as illustrated above. The inradius r, circumradius R, sagitta s, and area A of a regular hexagon can be computed ...

The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

A simple group is a group whose only normal subgroups are the trivial subgroup of order one and the improper subgroup consisting of the entire original group. Simple groups ...

A real polynomial P is said to be stable if all its roots lie in the left half-plane. The term "stable" is used to describe such a polynomial because, in the theory of linear ...

A sum is the result of an addition. For example, adding 1, 2, 3, and 4 gives the sum 10, written 1+2+3+4=10. (1) The numbers being summed are called addends, or sometimes ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

A magic square is a square array of numbers consisting of the distinct positive integers 1, 2, ..., n^2 arranged such that the sum of the n numbers in any horizontal, ...