Search Results for ""

A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...

Let F be the Maclaurin series of a meromorphic function f with a finite or infinite number of poles at points z_k, indexed so that 0<|z_1|<=|z_2|<=|z_3|<=..., then a pole ...

There are a number of attractive cube 20-compounds that can be constructed by taking the duals of the octahedra in the two octahedron 20-compounds. The second of these was ...

There are a number of attractive cube 25-compounds. One can be constructed from the vertices of the second dodecahedron 6-compound (or second tetrahedron 50-compound) and ...

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

Given a polygon with an even number of sides, the derived polygon is obtained by joining the points which are a fractional distance r along each side. If r=1/2, then the ...

A point traced out twice as a closed curve is traversed. The maximum number of double points for a nondegenerate quartic curve is three. An ordinary double point is also ...

A place nu of a number field k is an isomorphism class of field maps k onto a dense subfield of a nondiscrete locally compact field k_nu. In the function field case, let F be ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

A flexagon-like structure created by connecting the ends of a strip of four squares after folding along 45 degrees diagonals. Using a number of folding movements, it is ...