Search Results for ""

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).

For every partition of all the points on a line into two nonempty sets such that no point of either lies between two points of the other, there is a point of one set which ...

A Padé approximant perturbed with a Chebyshev polynomial of the first kind to reduce the leading coefficient in the error.

A nonreflexible regular map of genus 7 with eight graph vertices, 28 graph edges, and eight heptagonal faces.

A catastrophe which can occur for three control factors and two behavior axes. The elliptical umbilic is catastrophe of codimension 3 that has the equation ...

A finite-dimensional Lie algebra all of whose elements are ad-nilpotent is itself a nilpotent Lie algebra.

A program initiated by F. Klein in an 1872 lecture to describe geometric structures in terms of their automorphism groups.

A representation phi of a group G is faithful if it is one-to-one, i.e., if phi(g)=phi(h) implies g=h for g,h in G. Equivalently, phi is faithful if phi(g)=I_n implies g=e, ...

Any nondegenerate closed space curve may be nondegenerately deformed into either of the two curves illustrated above. Neither of these can be nondegenerately transformed into ...

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.