Search Results for ""

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 extended complex plane is the name given to the complex plane with a point at infinity attached: C union {infty^~}, where infty^~ denotes complex infinity. It is also ...

A polynomial which is not necessarily an invariant of a link. It is related to the dichroic polynomial. It is defined by the skein relationship ...

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 ...

The nth root of the content of the set sum of two sets in n-dimensional Euclidean space is greater than or equal to the sum of the nth roots of the contents of the individual ...

A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...