TOPICS
Search

Search Results for ""


5361 - 5370 of 13134 for Descriptive set theorySearch Results
A regular number, also called a finite decimal (Havil 2003, p. 25), is a positive number that has a finite decimal expansion. A number such as 1/3=0.33333... which is not ...
In the 1930s, Reidemeister first rigorously proved that knots exist which are distinct from the unknot. He did this by showing that all knot deformations can be reduced to a ...
The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...
The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...
The consideration of the result of a numerical calculation as a function of an adjustable parameter (usually the step size). The function can then be fitted and evaluated at ...
Let a closed interval [a,b] be partitioned by points a<x_1<x_2<...<x_(n-1)<b, where the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ...
The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...
A ring homomorphism is a map f:R->S between two rings such that 1. Addition is preserved:f(r_1+r_2)=f(r_1)+f(r_2), 2. The zero element is mapped to zero: f(0_R)=0_S, and 3. ...
The Robbins constant is the mean line segment length, i.e., the expected distance between two points chosen at random in cube line picking, namely Delta(3) = (1) = (2) = ...
The Robertson-Seymour theorem, also called the graph minor theorem, is a generalization of the Kuratowski reduction theorem by Robertson and Seymour, which states that the ...
1 ... 534|535|536|537|538|539|540 ... 1314 Previous Next

...