Search Results for ""

The fork graph, sometimes also called the chair graph, is the 5-vertex tree illustrated above. It could perhaps also be known as the 'h graph' (but not to be confused with ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

The function frac(x) giving the fractional (noninteger) part of a real number x. The symbol {x} is sometimes used instead of frac(x) (Graham et al. 1994, p. 70; Havil 2003, ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

Let K be a number field with r_1 real embeddings and 2r_2 imaginary embeddings and let r=r_1+r_2-1. Then the multiplicative group of units U_K of K has the form ...

Game theory is a branch of mathematics that deals with the analysis of games (i.e., situations involving parties with conflicting interests). In addition to the mathematical ...

Hex is a two-player game invented by Piet Hein in 1942 while a student at Niels Bohr's Institute for Theoretical Physics, and subsequently and independently by John Nash in ...

The Gauss-Kuzmin distribution is the distribution of occurrences of a positive integer k in the continued fraction of a random (or "generic") real number. Consider xi_n ...

Seeks to obtain the best numerical estimate of an integral by picking optimal abscissas x_i at which to evaluate the function f(x). The fundamental theorem of Gaussian ...

For a given m, determine a complete list of fundamental binary quadratic form discriminants -d such that the class number is given by h(-d)=m. Heegner (1952) gave a solution ...