Search Results for ""

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...

A theorem which effectively describes how lengths, areas, volumes, and generalized n-dimensional volumes (contents) are distorted by differentiable functions. In particular, ...

The metric properties discovered for a primitive figure remain applicable, without modifications other than changes of signs, to all correlative figures which can be ...

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

In finding the average area A^__R of a triangle chosen from a closed, bounded, convex region R of the plane, then A^__(T(R))=A^__R, for T any nonsingular affine ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

An alternating permutation is an arrangement of the elements c_1, ..., c_n such that no element c_i has a magnitude between c_(i-1) and c_(i+1) is called an alternating (or ...