Search Results for ""

A Goldbach number is a positive integer that is the sum of two odd primes (Li 1999). Let E(x) (the "exceptional set of Goldbach numbers") denote the number of even numbers ...

The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...

A real-valued function g defined on a convex subset C subset R^n is said to be quasi-concave if for all real alpha in R, the set {x in C:g(x)>=alpha} is convex. This is ...

A real-valued function g defined on a convex subset C subset R^n is said to be quasi-convex if for all real alpha in R, the set {x in C:g(x)<alpha} is convex. This is ...

An example of a subspace of the Euclidean plane that is connected but not pathwise-connected with respect to the relative topology. It is formed by the ray y=0, x<=0 and the ...

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...