The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 2961 – 2980 of 3028

Showing per page

Opérateurs de Hecke pour Γ 0 ( N ) et fractions continues

Loïc Merel (1991)

Annales de l'institut Fourier

Nous rappelons que Manin décrit l’homologie singulière relative aux pointes de la courbe modulaire X 0 ( N ) comme un quotient du groupe Z ( P 1 ( Z / N Z ) ) . En s’appuyant sur des techniques de fractions continues, nous donnons une expression indépendante de N d’un relèvement de l’action des opérateurs de Hecke de H 1 ( X 0 ( N ) , p t e s , Z ) sur Z ( P 1 ( Z / N Z ) ) .

Operations of Points on Elliptic Curve in Projective Coordinates

Yuichi Futa, Hiroyuki Okazaki, Daichi Mizushima, Yasunari Shidama (2012)

Formalized Mathematics

In this article, we formalize operations of points on an elliptic curve over GF(p). Elliptic curve cryptography [7], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security. We prove that the two operations of points: compellProjCo and addellProjCo are unary and binary operations of a point over the elliptic curve.

Opérations sur les mots de Christoffel

Éric Laurier (1999)

Journal de théorie des nombres de Bordeaux

On peut définir la pente d'un mot écrit avec des 0 et des 1 comme le nombre de 1 divisé par le nombre de 0, et généraliser cette définition aux mots de longueur infinie. Considérant le lien entre les mots de Christoffel et les fractions continues, on se propose d'étudier le comportement de tels mots lorsqu'on additionne leurs pentes, ou qu'on les multiplie par un entier positif. Après un bref exposé des différentes notions liées aux mots de Christoffel, l'étude de la somme et de la multiplication...

Optimal bound for the discrepancies of lacunary sequences

Christoph Aistleitner, Katusi Fukuyama, Yukako Furuya (2013)

Acta Arithmetica

The law of the iterated logarithm for discrepancies of lacunary sequences is studied. An optimal bound is given under a very mild Diophantine type condition.

Optimal curves differing by a 3-isogeny

Dongho Byeon, Donggeon Yhee (2013)

Acta Arithmetica

Stein and Watkins conjectured that for a certain family of elliptic curves E, the X₀(N)-optimal curve and the X₁(N)-optimal curve of the isogeny class 𝓒 containing E of conductor N differ by a 3-isogeny. In this paper, we show that this conjecture is true.

Optimal curves differing by a 5-isogeny

Dongho Byeon, Taekyung Kim (2014)

Acta Arithmetica

For i = 0,1, let E i be the X i ( N ) -optimal curve of an isogeny class of elliptic curves defined over ℚ of conductor N. Stein and Watkins conjectured that E₀ and E₁ differ by a 5-isogeny if and only if E₀ = X₀(11) and E₁ = X₁(11). In this paper, we show that this conjecture is true if N is square-free and is not divisible by 5. On the other hand, Hadano conjectured that for an elliptic curve E defined over ℚ with a rational point P of order 5, the 5-isogenous curve E’ := E/⟨P⟩ has a rational point of order...

Optimality of Chebyshev bounds for Beurling generalized numbers

Harold G. Diamond, Wen-Bin Zhang (2013)

Acta Arithmetica

If the counting function N(x) of integers of a Beurling generalized number system satisfies both 1 x - 2 | N ( x ) - A x | d x < and x - 1 ( l o g x ) ( N ( x ) - A x ) = O ( 1 ) , then the counting function π(x) of the primes of this system is known to satisfy the Chebyshev bound π(x) ≪ x/logx. Let f(x) increase to infinity arbitrarily slowly. We give a construction showing that 1 | N ( x ) - A x | x - 2 d x < and x - 1 ( l o g x ) ( N ( x ) - A x ) = O ( f ( x ) ) do not imply the Chebyshev bound.

Optimality of the Width- w Non-adjacent Form: General Characterisation and the Case of Imaginary Quadratic Bases

Clemens Heuberger, Daniel Krenn (2013)

Journal de Théorie des Nombres de Bordeaux

We consider digit expansions j = 0 - 1 Φ j ( d j ) with an endomorphism Φ of an Abelian group. In such a numeral system, the w -NAF condition (each block of w consecutive digits contains at most one nonzero) is shown to minimise the Hamming weight over all expansions with the same digit set if and only if it fulfills the subadditivity condition (the sum of every two expansions of weight 1 admits an optimal w -NAF).This result is then applied to imaginary quadratic bases, which are used for scalar multiplication in elliptic...

Currently displaying 2961 – 2980 of 3028