Search Results for ""

A circle packing is called rigid (or "stable") if every circle is fixed by its neighbors, i.e., no circle can be translated without disturbing other circles of the packing ...

The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...

If the faces of a convex polyhedron were made of metal plates and the polyhedron edges were replaced by hinges, the polyhedron would be rigid. The theorem was stated by ...

One of the three standard tori given by the parametric equations x = (c+acosv)cosu (1) y = (c+acosv)sinu (2) z = asinv (3) with c>a. This is the torus which is generally ...

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

The Robbins constant is the mean line segment length, i.e., the expected distance between two points chosen at random in cube line picking, namely Delta(3) = (1) = (2) = ...

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