Search Results for ""
1621 - 1630 of 2179 for Gray graphSearch Results
Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...
17 is a Fermat prime, which means that the 17-sided regular polygon (the heptadecagon) is constructible using compass and straightedge (as proved by Gauss).
A function f(x) is absolutely monotonic in the interval a<x<b if it has nonnegative derivatives of all orders in the region, i.e., f^((k))(x)>=0 (1) for a<x<b and k=0, 1, 2, ...
Inference of the truth of an unknown result obtained by noting its similarity to a result already known to be true. In the hands of a skilled mathematician, analogy can be a ...
An archaic name for the torus.
Two points are antipodal (i.e., each is the antipode of the other) if they are diametrically opposite. Examples include endpoints of a line segment, or poles of a sphere. ...
The vertex of an isosceles triangle having angle different from the two equal angles is called the apex of the isosceles triangle. The common polygon vertex at the top of a ...
Baxter's four-coloring constant for a triangular lattice is given by C^2 = product_(j=1)^(infty)((3j-1)^2)/((3j-2)(3j)) (1) = 3/(4pi^2)Gamma^3(1/3) (2) = 1.46099848... (3) ...
Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.
A section of a fiber bundle gives an element of the fiber over every point in B. Usually it is described as a map s:B->E such that pi degreess is the identity on B. A ...
...
View search results from all Wolfram sites (15739 matches)

