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 ...

There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...

A number taken to the power 3 is said to be cubed, so x^3 is called "x cubed." This terminology derives from the fact that the volume of a cube of edge length x is given by ...

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...

Let p be an odd prime and F_n the cyclotomic field of p^(n+1)th roots of unity over the rational field. Now let p^(e(n)) be the power of p which divides the class number h_n ...

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 binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...