Search Results for ""

A fractal process for which H<1/2, so r<0.

The largest n such that |z_n|<4 in a Mandelbrot set. Points of different count are often assigned different colors.

Quantifies deviation from translational invariance by describing the distribution of gaps within a set at multiple scales. The more lacunar a set, the more heterogeneous the ...

mu_i(epsilon), sometimes denoted P_i(epsilon), is the probability that element i is populated, normalized such that sum_(i=1)^Nmu_i(epsilon)=1.

A fractal process for which H>1/2, so r>0.

To multiply the size of a d-D object by a factor a, c=a^d copies are required, and the quantity d=(lnc)/(lna) is called the similarity dimension.

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...