Search Results for ""

In the directed graph above, pick any vertex and follow the arrows in sequence blue-red-red three times. You will finish at the green vertex. Similarly, follow the sequence ...

A stochastic approximation method that functions by placing conditions on iterative step sizes and whose convergence is guaranteed under mild conditions. However, the method ...

Building on work of Huntington (1933ab), Robbins conjectured that the equations for a Robbins algebra, commutativity, associativity, and the Robbins axiom !(!(x v y) v !(x v ...

The conjecture that the equations for a Robbins algebra, commutativity, associativity, and the Robbins axiom !(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes ...

The Robertson-Seymour theorem, also called the graph minor theorem, is a generalization of the Kuratowski reduction theorem by Robertson and Seymour, which states that the ...

A conjecture due to M. S. Robertson in 1936 which treats a univalent power series containing only odd powers within the unit disk. This conjecture implies the Bieberbach ...

Robertson's apex graph is the 15-vertex graph illustrated above constructed by Neil Robertson as an example of an apex graph that is not YDeltaY-reducible. The graph may be ...

Partial differential equation boundary conditions which, for an elliptic partial differential equation in a region Omega, specify that the sum of alphau and the normal ...

Rodrigues' rotation formula gives an efficient method for computing the rotation matrix R in SO(3) corresponding to a rotation by an angle theta about a fixed axis specified ...

The Rogers mod 14 identities are a set of three Rogers-Ramanujan-like identities given by A(q) = sum_(n=0)^(infty)(q^(n^2))/((q;q)_n(q;q^2)_n) (1) = ...