Search Results for ""

The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...

The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

An extremal graph in which the forced triangles are all the same color. Call R the number of red monochromatic forced triangles and B the number of blue monochromatic forced ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...