Displaying 21 – 40 of 73

Showing per page

The Josephus problem

Lorenz Halbeisen, Norbert Hungerbühler (1997)

Journal de théorie des nombres de Bordeaux

We give explicit non-recursive formulas to compute the Josephus-numbers j ( n , 2 , i ) and j ( n , 3 , i ) and explicit upper and lower bounds for j ( n , k , i ) (where k 4 ) which differ by 2 k - 2 (for k = 4 the bounds are even better). Furthermore we present a new fast algorithm to calculate j ( n , k , i ) which is based upon the mentioned bounds.

The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications

Guo-Niu Han (2010)

Annales de l’institut Fourier

The paper is devoted to the derivation of the expansion formula for the powers of the Euler Product in terms of partition hook lengths, discovered by Nekrasov and Okounkov in their study of the Seiberg-Witten Theory. We provide a refinement based on a new property of t -cores, and give an elementary proof by using the Macdonald identities. We also obtain an extension by adding two more parameters, which appears to be a discrete interpolation between the Macdonald identities and the generating function...

Currently displaying 21 – 40 of 73