Search Results for ""

Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...

The group theoretical term for what is known to physicists, by way of its connection with matrix traces, as the trace. The powerful group orthogonality theorem gives a number ...

A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

The Haferman carpet is the beautiful fractal constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[1 1 1; 1 1 1; 1 1 1],1->[0 1 0; 1 0 1; ...

Sequences of integers generated in the Collatz problem. For example, for a starting number of 7, the sequence is 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, ...

An elliptic function can be characterized by its real and imaginary half-periods omega_1 and omega_2 (Whittaker and Watson 1990, p. 428), sometimes also denoted ...

tau is the ratio tau=omega_2/omega_1 of the two half-periods omega_1 and omega_2 of an elliptic function (Whittaker and Watson 1990, pp. 463 and 473) defined such that the ...

Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...