Search Results for ""

The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...

A point lattice which can be constructed from an arbitrary parallelogram of unit area. For any such planar lattice, the minimum distance c between any two points is a ...

Disconnectivities are mathematical entities which stand in the way of a space being contractible (i.e., shrunk to a point, where the shrinking takes place inside the space ...

Mann's iteration is the dynamical system defined for a continuous function f:[0,1]->[0,1], x_n=1/nsum_(k=0)^(n-1)f(x_k) with x_0 in [0,1]. It can also be written ...

Let f(z) be an analytic function in an angular domain W:|argz|<alphapi/2. Suppose there is a constant M such that for each epsilon>0, each finite boundary point has a ...

A double point at which two (or more) osculating curves are tangent. The above plot shows the tacnode of the curve 2x^4-3x^2y+y^2-2y^3+y^4=0. The capricornoid and links curve ...

Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...

There is only one point in front of a perspective drawing where its three mutually perpendicular vanishing points appear in mutually perpendicular directions, but such a ...

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

The winding number of a contour gamma about a point z_0, denoted n(gamma,z_0), is defined by n(gamma,z_0)=1/(2pii)∮_gamma(dz)/(z-z_0) and gives the number of times gamma ...