Search Results for ""

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

A curve is simple if it does not cross itself.

The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

An algorithm for computing an Egyptian fraction.

Consider (1) If the probability distribution is governed by a Markov process, then P_3(y_1,t_1;y_2,t_2|y_3,t_3) = P_2(y_2,t_2|y_3,t_3) (2) = P_2(y_2|y_3,t_3-t_2). (3) ...

A polyhedron with extra triangular faces, given by the Schläfli symbol s{p; q}.

Johnson solid J_(85).

The symbol ∼ used to denote similarity, equivalence relations, or asymptosy.

A mathematical object is said to be symmetric if it is invariant ("looks the same") under a symmetry transformation. A function, matrix, etc., is symmetric if it remains ...