Search Results for ""

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

In general, a tetrahedron is a polyhedron with four sides. If all faces are congruent, the tetrahedron is known as an isosceles tetrahedron. If all faces are congruent to an ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...

A hosohedron is a regular tiling or map on a sphere composed of p digons or spherical lunes, all with the same two vertices and the same vertex angles, 2pi/p. Its Schläfli ...

Let M subset R^3 be a regular surface and u_(p) a unit tangent vector to M, and let Pi(u_(p),N(p)) be the plane determined by u_(p) and the normal to the surface N(p). Then ...

A point p on a regular surface M in R^3 is said to be parabolic if the Gaussian curvature K(p)=0 but S(p)!=0 (where S is the shape operator), or equivalently, exactly one of ...

A point p on a regular surface M in R^3 is said to be planar if the Gaussian curvature K(p)=0 and S(p)=0 (where S is the shape operator), or equivalently, both of the ...

A topological space fulfilling the T3-separation axiom: X fulfils the T1-separation axiom and is regular. According to the terminology of Alexandroff and Hopf (1972), ...