Search Results for ""

A connection between two or more vertices of a hypergraph. A hyperedge connecting just two vertices is simply a usual graph edge.

A vector field v for which the curl vanishes, del xv=0.

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

Let S be partitioned into r×s disjoint sets E_i and F_j where the general subset is denoted E_i intersection F_j. Then the marginal probability of E_i is ...

A minimization of the maximum error for a fixed number of terms.

A set M of all polynomials in s variables, x_1, ..., x_s such that if P, P_1, and P_2 are members, then so are P_1+P_2 and QP, where Q is any polynomial in x_1, ..., x_s.

A sequence {a_n} such that either (1) a_(i+1)>=a_i for every i>=1, or (2) a_(i+1)<=a_i for every i>=1.

If one event can occur in m ways and a second can occur independently of the first in n ways, then the two events can occur in mn ways.

n events are said to be mutually exclusive if the occurrence of any one of them precludes any of the others. Therefore, for events X_1, ..., X_n, the conditional probability ...

An element B of a ring is nilpotent if there exists a positive integer k for which B^k=0.