Search Results for ""

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

The Bump-Ng theorem (and also the title of the paper in which it was proved) states that the zeros of the Mellin transform of Hermite functions have real part equal to 1/2.

The partial differential equation u_t+uu_x=nuu_(xx) (Benton and Platzman 1972; Zwillinger 1995, p. 417; Zwillinger 1997, p. 130). The so-called nonplanar Burgers equation is ...

The Burridge-Knopoff model is a system of differential equations used to model earthquakes using n points on a straight line, each of mass m, that interact with each other ...

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

The Cairo tessellation is a tessellation appearing in the streets of Cairo and in many Islamic decorations. Its tiles are obtained by projection of a dodecahedron, and it is ...

Letting Lk be the linking number of the two components of a ribbon, Tw be the twist, and Wr be the writhe, then Lk(K)=Tw(K)+Wr(K). (Adams 1994, p. 187).

A Cartesian product of any finite or infinite set I of copies of Z_2, equipped with the product topology derived from the discrete topology of Z_2. It is denoted Z_2^I. The ...

For any sets A and B, their cardinal numbers satisfy |A|<=|B| iff there is a one-to-one function f from A into B (Rubin 1967, p. 266; Suppes 1972, pp. 94 and 116). It is easy ...