Search Results for ""
591 - 600 of 736 for COMPLEXITYSearch Results

A graceful permutation sigma on n letters is a permutation such that {|sigma(i)-sigma(i+1)|:i=1,2,...,n-1}={1,2,...,n-1}. For example, there are four graceful permutations on ...
An equation derived by Kronecker: where r(n) is the sum of squares function, zeta(z) is the Riemann zeta function, eta(z) is the Dirichlet eta function, Gamma(z) is the gamma ...
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 ...
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; ...
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 a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...
A point process N on R is said to be interval stationary if for every r=1,2,3,... and for all integers i_i,...,i_r, the joint distribution of {tau_(i_1+k),...,tau_(i_r+k)} ...
"The" Jacobi identity is a relationship [A,[B,C]]+[B,[C,A]]+[C,[A,B]]=0,, (1) between three elements A, B, and C, where [A,B] is the commutator. The elements of a Lie algebra ...
Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...
The Kreisel conjecture is a conjecture in proof theory that postulates that, if phi(x) is a formula in the language of arithmetic for which there exists a nonnegative integer ...

...