Search Results for ""

Rule 90 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

"The" square graphs is the cycle graph C_4. It is isomorphic to the complete bipartite graph K_(2,2). Like all cycle graphs, the line graph of C_4 is isomorphic to itself. A ...

The hyperbolic sine is defined as sinhz=1/2(e^z-e^(-z)). (1) The notation shz is sometimes also used (Gradshteyn and Ryzhik 2000, p. xxix). It is implemented in the Wolfram ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

A sequence of random variates X_0, X_1, ... is called absolutely fair if for n=1, 2, ..., <X_1>=0 and <X_(n+1)|X_1,...,X_n>=0 (Feller 1971, p. 210).

A term in logic meaning pertaining to truth and falsehood.

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 process used to generate an expression for a covariant in the first degree of any one of the equivalent sets of coefficients for a curve.

In general, the catacaustics of the astroid are complicated curves. For an astroid with parametric equations x = cos^3t (1) y = sin^3t, (2) the catacaustic for a radiant ...

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