Search Results for ""

The arithmetic-geometric index of a graph is defined as half the sum of the matrix elements of its arithmetic-geometric matrix.

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 ...

The axiom of Zermelo-Fraenkel set theory which asserts that sets formed by the same elements are equal, forall x(x in a=x in b)=>a=b. Note that some texts (e.g., Devlin ...

One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of the power set x consisting of all the subsets of a. The axiom may be stated symbolically as ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any sets a and b of a set x having a and b as its only elements. x is called the unordered pair of a ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

An optical illusion consisting of a spinnable top marked in black with the pattern shown above. When the wheel is spun (especially slowly), the black broken lines appear as ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

A two-sided (doubly infinite) Z-Transform, Z^((2))[{a_n}_(n=-infty)^infty](z)=sum_(n=-infty)^infty(a_n)/(z^n) (Zwillinger 1996; Krantz 1999, p. 214). The bilateral transform ...

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...