Search Results for ""

The "Foxtrot series" is a mathematical sum that appeared in the June 2, 1996 comic strip FoxTrot by Bill Amend (Amend 1998, p. 19; Mitchell 2006/2007). It arose from a ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...

The (not necessarily regular) tetrahedron of least volume circumscribed around a convex body B with volume V is not known. If B is a parallelepiped, then the smallest-volume ...

Minimal surfaces are defined as surfaces with zero mean curvature. A minimal surface parametrized as x=(u,v,h(u,v)) therefore satisfies Lagrange's equation, ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

A sphere with a single cross-cap. This term is more appropriate in purely topological applications than the more common term real projective plane, which implies the presence ...

A problem in game theory first discussed by A. Tucker. Suppose each of two prisoners A and B, who are not allowed to communicate with each other, is offered to be set free if ...

Any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal grid (i.e., the honeycomb, illustrated above). Pappus refers to the ...