Search Results for ""

A recursively enumerable set A is creative if its complement is productive. Creative sets are not recursive. The property of creativeness coincides with completeness. Namely, ...

A 15_3 configuration of 15 lines and 15 points, with three lines through three points, three points on every line, and containing no triangles. It is illustrated above in two ...

A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...

Let n points xi_1, ..., xi_n be randomly distributed on a domain S, and let H be some event that depends on the positions of the n points. Let S^' be a domain slightly ...

Consider a convex plane curve K with perimeter L, and the set of points P exterior to K. Further, let t_1 and t_2 be the perpendicular distances from P to K (with ...

A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...

A cryptographic hash function is most commonly one of the following: a one-way hash function, a collision-free hash function, a trapdoor one-way hash function, or a function ...

The science of adversarial information protection.

The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...

A cubefree word contains no cubed words as subwords. The number of binary cubefree words of length n=1, 2, ... are 2, 4, 6, 10, 16, 24, 36, 56, 80, 118, ... (OEIS A028445). ...