A common combinatorial principle underlies Riemann's formula, the Chebyshev phenomenon, and other subtle effects in comparative prime number theory. I.
Richard H. Hudson (1980)
Journal für die reine und angewandte Mathematik
Voigt, B. (1984)
Proceedings of the 11th Winter School on Abstract Analysis
Zhang, Zhizheng, Wang, Jun (2005)
Integers
Cossali, G.E. (2003)
Journal of Integer Sequences [electronic only]
Amitabha Tripathi (1993)
Acta Arithmetica
Ulrich Schmitt (2015)
Acta Arithmetica
The aim of this paper is to compare two modules of elliptic units, which arise in the study of elliptic curves E over quadratic imaginary fields K with complex multiplication by , good ordinary reduction above a split prime p and prime power conductor (over K). One of the modules is a special case of those modules of elliptic units studied by K. Rubin in his paper [Invent. Math. 103 (1991)] on the two-variable main conjecture (without p-adic L-functions), and the other module is a smaller one,...
John W. Jones (1990)
Manuscripta mathematica
G. Greaves (1985)
Banach Center Publications
O'Bryant, Kevin (2004)
The Electronic Journal of Combinatorics [electronic only]
Develin, Mike (2000)
The Electronic Journal of Combinatorics [electronic only]
R. Mollin, H. Williams (1992)
Colloquium Mathematicae
D. Martinalis, L. Schneps (1993)
Manuscripta mathematica
Deshouillers, J.-M., Effinger, G., te Riele, H., Zinoviev, D. (1997)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Stephen Beale, D.K. Harrison (1989)
Aequationes mathematicae
Roland Quême (1998)
Journal de théorie des nombres de Bordeaux
This article describes a computer algorithm which exhibits a sufficient condition for a number field to be euclidean for the norm. In the survey [3] p 405, Franz Lemmermeyer pointed out that 743 number fields where known (march 1994) to be euclidean (the first one, , discovered by Euclid, three centuries B.C.!). In the first months of 1997, we found more than 1200 new euclidean number fields of degree 4, 5 and 6 with a computer algorithm involving classical lattice properties of the embedding of...
Chip Snyder (1979)
Journal für die reine und angewandte Mathematik
Chip Snyder (1981)
Manuscripta mathematica
Andrea Mori (1991)
Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni
Let be a weight holomorphic automorphic form with respect to . We prove a sufficient condition for the integrality of over primes dividing . This condition is expressed in terms of the values at particular curves of the forms obtained by iterated application of the weight Maaß operator to and extends previous results of the Author.
Alessandro Zaccagnini (2000)
Acta Arithmetica
A. Languasco (1998)
Acta Arithmetica