On the p-adic height of Heegner cycles.
Jan Nekovár (1995)
Mathematische Annalen
Similarity:
Jan Nekovár (1995)
Mathematische Annalen
Similarity:
V. I. Sushchanski, E. Moćko, V. V. Nekrashevych (2006)
Colloquium Mathematicae
Similarity:
We give a description of possible sets of cycle lengths for distance-decreasing maps and isometries of the ring of n-adic integers.
Marcus Nilsson (2000)
Annales mathématiques Blaise Pascal
Similarity:
Takeshi Tsuji (1996)
Journal für die reine und angewandte Mathematik
Similarity:
P. Deligne (1984)
Inventiones mathematicae
Similarity:
Edgardo Ugalde (2000)
Journal de théorie des nombres de Bordeaux
Similarity:
A new class of -adic normal numbers is built recursively by using Eulerian paths in a sequence of de Bruijn digraphs. In this recursion, a path is constructed as an extension of the previous one, in such way that the -adic block determined by the path contains the maximal number of different -adic subblocks of consecutive lengths in the most compact arrangement. Any source of redundancy is avoided at every step. Our recursive construction is an alternative to the several well-known...
John L. Simons (2008)
Acta Arithmetica
Similarity:
D. Brink, H. Godinho, P. H. A. Rodrigues (2008)
Acta Arithmetica
Similarity:
M. Ram Murty, N. Saradha (2008)
Acta Arithmetica
Similarity:
Pierre Bel (2009)
Acta Arithmetica
Similarity:
Lawrence Washington (1981)
Acta Arithmetica
Similarity:
Arnt Volkenborn (1974)
Mémoires de la Société Mathématique de France
Similarity:
Manuel Ladra, Bakhrom Omirov, Utkir Rozikov (2013)
Open Mathematics
Similarity:
We study the p-adic equation x q = a over the field of p-adic numbers. We construct an algorithm which gives a solvability criteria in the case of q = p m and present a computer program to compute the criteria for any fixed value of m ≤ p − 1. Moreover, using this solvability criteria for q = 2; 3; 4; 5; 6, we classify p-adic 6-dimensional filiform Leibniz algebras.
Berkovich, Vladimir G. (1998)
Documenta Mathematica
Similarity: