Search Results for ""

If G is a group, then the torsion elements Tor(G) of G (also called the torsion of G) are defined to be the set of elements g in G such that g^n=e for some natural number n, ...

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

A knot move illustrated above. Two knots cannot be distinguished using Vassiliev invariants of order <=n iff they are related by a sequence of such moves (Habiro 2000). There ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

The largest unit fraction, 1/2. 1/2 is a rational number with terminating decimal expansion 0.5.

The Hall-Montgomery constant is related to the multiplicative spectrum of completely multiplicative functions and has closed form delta_0 = ...

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

The Harada-Norton group is the sporadic group HN of order |HN| = 273030912000000 (1) = 2^(14)·3^6·5^6·7·11·19. (2) It is implemented in the Wolfram Language as ...

Let omega(n) be the number of distinct prime factors of n. If Psi(x) tends steadily to infinity with x, then lnlnx-Psi(x)sqrt(lnlnx)<omega(n)<lnlnx+Psi(x)sqrt(lnlnx) for ...