p-adic polylogarithms and irrationality
Pierre Bel (2009)
Acta Arithmetica
Similarity:
Pierre Bel (2009)
Acta Arithmetica
Similarity:
F. Tulone (2004)
Mathematica Bohemica
Similarity:
In this paper we prove that each differentiation basis associated with a -adic path system defined by a bounded sequence satisfies the Ward Theorem.
M. Ram Murty, N. Saradha (2008)
Acta Arithmetica
Similarity:
Lawrence Washington (1981)
Acta Arithmetica
Similarity:
Arnt Volkenborn (1974)
Mémoires de la Société Mathématique de France
Similarity:
De Wannemacker, Stefan (2005)
Integers
Similarity:
Gerlits, J.
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.
Peter Hellekalek (2009)
Acta Arithmetica
Similarity: