Search Results for ""

The Wolstenholme numbers are defined as the numerators of the generalized harmonic number H_(n,2) appearing in Wolstenholme's theorem. The first few are 1, 5, 49, 205, 5269, ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

The only Wiedersehen surfaces are the standard round spheres. The conjecture was proven by combining the Berger-Kazdan comparison theorem with A. Weinstein's results for n ...

Let W(u) be a Wiener process. Then where V_t=f(W(t),tau) for 0<=tau=T-t<=T, and f in C^(2,1)((0,infty)×[0,T]). Note that while Ito's lemma was proved by Kiyoshi Ito (also ...

A set which is connected but not simply connected is called multiply connected. A space is n-multiply connected if it is (n-1)-connected and if every map from the n-sphere ...

The nullity of a linear transformation f:V->W of vector spaces is the dimension of its null space. The nullity and the map rank add up to the dimension of V, a result ...

Teichmüller's theorem asserts the existence and uniqueness of the extremal quasiconformal map between two compact Riemann surfaces of the same genus modulo an equivalence ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...