Search Results for ""

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

Compass and straightedge geometric constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ...

A contingency table, sometimes called a two-way frequency table, is a tabular mechanism with at least two rows and two columns used in statistics to present categorical data ...

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

There exists an integer N such that every string in the look and say sequence "decays" in at most N days to a compound of "common" and "transuranic elements." The table below ...

The Costa surface is a complete minimal embedded surface of finite topology (i.e., it has no boundary and does not intersect itself). It has genus 1 with three punctures ...

An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...

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 ...

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].

If a, b, c, and d are points in the extended complex plane C^*, their cross ratio, also called the cross-ratio (Courant and Robbins 1996, p. 172; Durell 1928, p. 73), ...