Search Results for ""

Giving a set F={f_1,f_2,...,f_n} of contracting similitudes of R^l, the closed set E is said to be subselfsimilar for F if E subset union _(i=1)^nf_i(E) (Falconer 1995, ...

The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...

A class is a generalized set invented to get around Russell's antinomy while retaining the arbitrary criteria for membership which leads to difficulty for sets. The members ...

A convex set K is centro-symmetric, sometimes also called centrally symmetric, if it has a center p that bisects every chord of K through p.

Axiomatic set theory is a version of set theory in which axioms are taken as uninterpreted rather than as formalizations of pre-existing truths.

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

The fractal-like figure obtained by performing the same iteration as for the Mandelbrot set, but adding a random component R, z_(n+1)=z_n^2+c+R. In the above plot, ...

The level set of a differentiable function f:R^n->R corresponding to a real value c is the set of points {(x_1,...,x_n) in R^n:f(x_1,...,x_n)=c}. For example, the level set ...

A subset F subset R of the real numbers is said to be an F_sigma set provided F is the countable union of closed sets. The name F_sigma comes from French: The F stands for ...