We develop a recursive method for computing the -removed -orderings and -orderings of order the characteristic sequences associated to these and limits associated to these sequences for subsets of a Dedekind domain This method is applied to compute these objects for and .
Let be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field . The field of definition of is the ring class field of the order. If the prime splits completely in , then we can reduce modulo one the factors of and get a curve defined over . The trace of the Frobenius of is known up to sign and we need a fast way to find this sign, in the context of the Elliptic Curve Primality Proving algorithm (ECPP). For this purpose, we propose...
Using the link between Galois representations and modular forms established by Serre’s Conjecture, we compute, for every prime , a lower bound for the number of isomorphism classes of Galois representation of on a two–dimensional vector space over which are irreducible, odd, and unramified outside .
0. Introduction. The content of this paper is part of the author's Ph.D. thesis. The two new theorems in this paper provide upper bounds on the concentration function of additive functions evaluated on shifted γ-twin prime, where γ is any positive even integers. Both results are generalizations of theorems due to I. Z. Ruzsa, N. M. Timofeev, and P. D. T. A. Elliott.
A classic theorem of Pólya shows that the function is the “smallest” integral-valued entire transcendental function. A variant due to Gel’fond applies to entire functions taking integral values on a geometric progression of integers, and Bézivin has given a generalization of both results. We give a sharp formulation of Bézivin’s result together with a further generalization.