Search Results for ""

A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...

The radial curve of the deltoid x = 1/3a[2cost+cos(2t)] (1) y = 1/3a[2sint-sin(2t)] (2) with radiant point (x_0,y_0) is the trifolium x_r = x_0+4/3a[cost-cos(2t)] (3) y_r = ...

The limit points of a set P, denoted P^'.

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

The dodecicosahedral graph is the skeleton graph of the great ditrigonal dodecicosidodecahedron, great dodecicosahedron, great icosicosidodecahedron, small ditrigonal ...

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.

A statement which is rigorously not true. Regular two-valued logic allows statements to be only true or false, but fuzzy logic treats "truth" as a continuum which can have a ...

An alternative name for an associated Legendre polynomial.

Let G be a group and S be a set. Then S is called a left G-set if there exists a map phi:G×S->S such that phi(g_1,phi(g_2,s))=phi(g_1g_2,s) for all s in S and all g_1,g_2 in ...