Search Results for ""

Each of the maps of a cochain complex ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->... is known as a coboundary operator.

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...

The simple first-order difference equation y_(t+1)-Ay_t=B, (1) where A = -(m_s)/(m_d) (2) B = (b_d-b_s)/(m_d) (3) and D_t = -m_dp_t+b_d (4) S_(t+1) = m_sp_t+b_s (5) are the ...

The cochleoid, whose name means "snail-form" in Latin, was first considered by John Perks as referenced in Wallis et al. (1699). The cochleoid has also been called the oui-ja ...

The inverse curve of the cochleoid r=(sintheta)/theta (1) with inversion center at the origin and inversion radius k is the quadratrix of Hippias. x = ktcottheta (2) y = kt. ...

The converse of Fisher's theorem.

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

In a cochain complex of modules ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->... the module Z^i of i-cocycles Z^i is the kernel of d^i, which is a submodule of C^i.

A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...

Code 177 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.