Search Results for ""

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...

A Julia set J consisting of a set of isolated points which is formed by taking a point outside an underlying set M (e.g., the Mandelbrot set). If the point is outside but ...

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...

There are several equivalent definitions of a closed set. Let S be a subset of a metric space. A set S is closed if 1. The complement of S is an open set, 2. S is its own set ...

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

The set difference A\B is defined by A\B={x:x in A and x not in B}. Here, the backslash symbol is defined as Unicode U+2216. The set difference is therefore equivalent to the ...

A set of plane measure 0 that contains a circle of every radius.