Search Results for ""

A multiway system that generates causal networks which are all isomorphic as acyclic digraphs is said to exhibit causal invariance, and the causal network itself is also said ...

A causal network is an acyclic digraph arising from an evolution of a substitution system, and representing its history. The illustration above shows a causal network ...

Given A = |a_(11)-x a_(12) ... a_(1m); a_(21) a_(22)-x ... a_(2m); | | ... |; a_(m1) a_(m2) ... a_(mm)-x| (1) = x^m+c_(m-1)x^(m-1)+...+c_0, (2) then ...

The only nonassociative division algebra with real scalars. There is an 8-square identity corresponding to this algebra. The elements of a Cayley algebra are called Cayley ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...

Let X and Y be CW-complexes, and let f:X->Y be a continuous map. Then the cellular approximation theorem states that any such f is homotopic to a cellular map. In fact, if ...

A centered polygonal number consisting of a central dot with five dots around it, and then additional dots in the gaps between adjacent dots. The general term is ...

A centered polygonal number consisting of a central dot with four dots around it, and then additional dots in the gaps between adjacent dots. The general term is n^2+(n+1)^2, ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

A centered triangular number is a centered polygonal number consisting of a central dot with three dots around it, and then additional dots in the gaps between adjacent dots. ...