Search Results for ""

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

There are a number of functions in mathematics denoted with upper or lower case Qs. 1. The nome q. 2. A prefix denoting q-analogs and q-series. 3. Q_n or q_n with n=0, 1, 2, ...

The ratio of two independent estimates of the variance of a normal distribution.

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

A Thâbit ibn Kurrah number, sometimes called a 321-number, is a number of the form K_n=3·2^n-1. The first few for n=0, 1, ... are 2, 5, 11, 23, 47, 95, 191, 383, 767, ... ...

A random number generator produced by iterating X_(n+1)=|100lnX_n (mod 1)| for a seed X_0=0.1. This simple generator passes the noise sphere test for randomness by showing no ...

The quadratic class number constant is a constant related to the average behavior of class numbers of real quadratic fields. It is given by Q = product_(p)[1-1/(p^2(p+1))] ...

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...

A set A in a first-countable space is dense in B if B=A union L, where L is the set of limit points of A. For example, the rational numbers are dense in the reals. In ...

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