Search Results for ""

A version of set theory which is a formal system expressed in first-order predicate logic. Zermelo-Fraenkel set theory is based on the Zermelo-Fraenkel axioms. ...

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

The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...

Given a set X, let F be a nonempty set of subsets of X. Then F is a ring if, for every pair of sets in F, the intersection, union, and set difference is also in F. F is ...

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

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

The set of elements belonging to one but not both of two given sets. It is therefore the union of the complement of A with respect to B and B with respect to A, and ...

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