p-adic polylogarithms and irrationality
Pierre Bel (2009)
Acta Arithmetica
Similarity:
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.
Pierre Bel (2009)
Acta Arithmetica
Similarity:
Lawrence Washington (1981)
Acta Arithmetica
Similarity:
M. Ram Murty, N. Saradha (2008)
Acta Arithmetica
Similarity:
Ehud de Shalit, Robert Coleman (1988)
Inventiones mathematicae
Similarity:
Arnt Volkenborn (1974)
Mémoires de la Société Mathématique de France
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.
J.D. Dixon (1982)
Numerische Mathematik
Similarity:
Arnt Vokenborn (1974)
Manuscripta mathematica
Similarity:
T. Chatterjee, S. Gun (2014)
Acta Arithmetica
Similarity:
The goal of this article is twofold. First, we extend a result of Murty and Saradha (2007) related to the digamma function at rational arguments. Further, we extend another result of the same authors (2008) about the nature of p-adic Euler-Lehmer constants.
D. Brink, H. Godinho, P. H. A. Rodrigues (2008)
Acta Arithmetica
Similarity:
Kejian Xu, Zhaopeng Dai, Zongduo Dai (2011)
Acta Arithmetica
Similarity: