Search Results for ""

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

The biconjugate gradient method often displays rather irregular convergence behavior. Moreover, the implicit LU decomposition of the reduced tridiagonal system may not exist, ...

A generalized conformal mapping.

A Reeb component is a Reeb foliation (M,F) whose leaves are proper. A foliation which has no Reeb components is said to be Reebless.

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A transformation in which all points along a given line L remain fixed while other points are shifted parallel to L by a distance proportional to their perpendicular distance ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...

If M^n is a differentiable homotopy sphere of dimension n>=5, then M^n is homeomorphic to S^n. In fact, M^n is diffeomorphic to a manifold obtained by gluing together the ...

A normed vector space X=(X,||·||_X) is said to be uniformly convex if for sequences {x_n}={x_n}_(n=1)^infty, {y_n}={y_n}_(n=1)^infty, the assumptions ||x_n||_X<=1, ...

A theorem that classifies planar regular closed curves up to regular homotopy by their contour winding numbers (Whitney 1937). In his thesis, S. Smale generalized this result ...