Search Results for ""

A structure consisting of an ordered set of sorted lists such that the head and tail entries of later lists nest within earlier ones. For example, an encroaching list set for ...

A sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...

A set of positive integers S is called sum-free if the equation x+y=z has no solutions x, y, z in S. The probability that a random sum-free set S consists entirely of odd ...

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...

A random closed set (RACS) in R^d is a measurable function from a probability space (Omega,A,P) into (F,Sigma) where F is the collection of all closed subsets of R^d and ...

A set having the largest number k of distinct residue classes modulo m so that no subset has zero sum.

The set closure of the set of arguments of a function f for which f is not zero.

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

A subset E of a topological space S is said to be nonmeager if E is of second category in S, i.e., if E cannot be written as the countable union of subsets which are nowhere ...

A subset S of a topological space X is compact if for every open cover of S there exists a finite subcover of S.