Search Results for ""

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

The term "rhombicosidodecahedron" is most commonly used (e.g., Wenninger 1989, p. 28; Maeder 1997. Model 27) to refer to the 62-faced Archimedean solid with faces ...

The term "rhombicuboctahedron" is most commonly used (e.g., Wenninger 1989, p. 27; Maeder 1997) to refer to the 26-faced Archimedean solid with faces 8{3}+18{4}. Cundy and ...

The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...

A closed curve associated with a knot which is displaced along the normal by a small amount. For a knot K parameterized as x^mu(s) for 0<=s<=L along the length of the knot by ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.

The polyhedron compound of the great icosahedron (U_(53)) and the small stellated dodecahedron (U_(34)), sometimes known as the great cid. Four faces meet at each edge of the ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...