Search Results for ""

The problem of determining the vertices of a Schwarz-Christoffel mapping (Krantz 1999, p. 176).

A Cantor set C in R^3 is said to be scrawny if for each neighborhood U of an arbitrary point p in C, there is a neighborhood V of p such that every map f:S^1->V subset C ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

A curve is simple if it does not cross itself.

The set St^_v-Stv, where St^_v is a closed star and Stv is a star, is called the link of v in a simplicial complex K and is denoted Lkv (Munkres 1993, p. 11).

The partial differential equation u_(xt)=sinhu, which contains u_(xt) instead of u_(xx)-u_(tt) and sinhu instead to sinu, as in the sine-Gordon equation (Grauel 1985; ...

The dual polyhedron of the small dodecicosidodecahedron U_(33) and Wenninger dual W_(72).

A Jordan algebra which is isomorphic to a subalgebra.

An n×n array is called a square array. Considered as a matrix, a square array is called a square matrix.

A function f(x) is said to be square integrable if int_(-infty)^infty|f(x)|^2dx is finite.