Search Results for ""

A polygrammic prism is a prism formed by two regular polygrams offset along their symmetry axis and with corresponding edges connected by lateral faces. The hexagrammic prism ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

Lachlan's terms for a collection of n points.

The upper horizontal line segment in the above figure appears to be longer than the lower line segment despite the fact that both are the same length.

You buy 100 pounds of potatoes and are told that they are 99% water. After leaving them outside, you discover that they are now 98% water. The weight of the dehydrated ...

The branch of formal logic, also called functional calculus, that deals with representing the logical connections between statements as well as the statements themselves.

An Abelian planar difference set of order n exists only for n a prime power. Gordon (1994) has verified it to be true for n<2000000.

A data structure designed to allow repeated extraction of the smallest remaining key (Skiena 1990, p. 38).

A Möbius strip with finite thickness.

A group action of a topological group G on a topological space X is said to be a proper group action if the mapping G×X->X×X(g,x)|->(gx,x) is a proper map, i.e., inverses of ...