Search Results for ""

If S is any nonempty partially ordered set in which every chain has an upper bound, then S has a maximal element. This statement is equivalent to the axiom of choice. Renteln ...

Let union represent "or", intersection represent "and", and ^' represent "not." Then, for two logical units E and F, (E union F)^'=E^' intersection F^' (E intersection ...

A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...

A p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

A Bland-Altman plot is a data plotting method which simultaneously presents data sets from two different tests in a way that allows for easier determination of whether the ...

A polynomial form which is the sum of two polynomial forms involving separate sets of variables.

In continuum percolation theory, the so-called germ-grain model is an obvious generalization of both the Boolean and Boolean-Poisson models which is driven by an arbitrary ...

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

The simplicial complex formed from a family of objects by taking sets that have nonempty intersections.