Search Results for ""

A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...

Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

Two knots are pass equivalent if there exists a sequence of pass moves taking one to the other. Every knot is either pass equivalent to the unknot or trefoil knot. These two ...

A patch (also called a local surface) is a differentiable mapping x:U->R^n, where U is an open subset of R^2. More generally, if A is any subset of R^2, then a map x:A->R^n ...

A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

The n-path complement graph P^__n is the graph complement of the path graph P_n. The first few are illustrated above. Since P_4 is self-complementary, P^__4 is isomorphic to ...

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space Y^X supplied with the compact-open topology is called a mapping space. If (Y,*) is a pointed ...

According to G. Pólya, the method of finding geometric objects by intersection. 1. For example, the centers of all circles tangent to a straight line s at a given point P lie ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...