Search Results for ""

The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...

A mapping of random number triples to points in spherical coordinates according to theta = 2piX_n (1) phi = piX_(n+1) (2) r = sqrt(X_(n+2)) (3) in order to detect unexpected ...

Several flavors of the open mapping theorem state: 1. A continuous surjective linear mapping between Banach spaces is an open map. 2. A nonconstant analytic function on a ...

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...

The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...

The pentakis dodecahedron is the 60-faced dual polyhedron of the truncated icosahedron A_(11) (Holden 1971, p. 55). It is Wenninger dual W_9. It can be constructed by ...

Consider n intersecting circles. The maximal number of regions into which these divide the plane are N(n)=n^2-n+2, giving values for n=1, 2, ... of 2, 4, 8, 14, 22, 32, 44, ...

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...

The term "poweroid" has at least two meanings. Sheffer sequences are sometimes called poweroids (Steffensen 1941, Shiu 1982, Di Bucchianico and Loeb 2000). Jackway and ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.