Search Results for ""

The two-dimensional Hammersley point set of order m is defined by taking all numbers in the range from 0 to 2^m-1 and interpreting them as binary fractions. Calling these ...

A set of positive integers is called weakly triple-free if, for any integer x, the set {x,2x,3x} !subset= S. For example, all subsets of {1,2,3,4,5} are weakly triple-free ...

A Cantor set C in R^3 is said to be scrawny if for each neighborhood U of an arbitrary point p in C, there is a neighborhood V of p such that every map f:S^1->V subset C ...

A curve on which points of a map z_n (such as the Mandelbrot set) diverge to a given value r_(max) at the same rate. A common method of obtaining lemniscates is to define an ...

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 set of positive integers is double-free if, for any integer x, the set {x,2x} !subset= S (or equivalently, x in S implies 2x not in S). For example, of the subsets of ...

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 having the largest number k of distinct residue classes modulo m so that no subset has zero sum.