Displaying 3841 – 3860 of 16591

Showing per page

Efficient computation of addition chains

F. Bergeron, J. Berstel, S. Brlek (1994)

Journal de théorie des nombres de Bordeaux

The aim of this paper is to present a unifying approach to the computation of short addition chains. Our method is based upon continued fraction expansions. Most of the popular methods for the generation of addition chains, such as the binary method, the factor method, etc..., fit in our framework. However, we present new and better algorithms. We give a general upper bound for the complexity of continued fraction methods, as a function of a chosen strategy, thus the total number of operations required...

Eigenspaces of the ideal class group

Cornelius Greither, Radan Kučera (2014)

Annales de l’institut Fourier

The aim of this paper is to prove an analog of Gras’ conjecture for an abelian field F and an odd prime p dividing the degree [ F : ] assuming that the p -part of Gal ( F / ) group is cyclic.

Eigenvalues in the large sieve inequality, II

Olivier Ramaré (2010)

Journal de Théorie des Nombres de Bordeaux

We explore numerically the eigenvalues of the hermitian form q Q a mod * q n N ϕ n e ( n a / q ) 2 when N = q Q φ ( q ) . We improve on the existing upper bound, and produce a (conjectural) plot of the asymptotic distribution of its eigenvalues by exploiting fairly extensive computations. The main outcome is that this asymptotic density most probably exists but is not continuous with respect to the Lebesgue measure.

Currently displaying 3841 – 3860 of 16591