A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain generalizations of the harmonic numbers. We apply the technique to derive many new supercongruences. We also provide software for finding and proving supercongruences using our technique.
The present work involves infinite, @math -adically convergent series identities involving multiple harmonic sums, and in Section we look at related series involving truncated multiple polylogarithms. A recent work of Seki @cite_6 investigates a closely related @math -adic series identity for truncated multiple polylogarithms.
@cite_6
230449344 2324838733 2146489966 2117489802
Let ( O ) k be the ring of integers of a finite extension k of the field ( Q ) p of p-adic numbers. The endomorphisms of a formal group law defined over ( O ) k provide nontrivial examples of commuting formal series with coefficients in ( O ) k . This article deals with the inverse problem formulated by Jonathan Lubin within the context of non-Archimedean dynamical systems. We present a large family of series, with coefficients in ( Z ) p , which satisfy Lubin's conjecture. These series are constructed with the help of Lubin–Tate formal group laws over ( Q ) p . We introduce the notion of minimally ramified series which turn out to be modulo p reductions of some series of this family. The commutant monoids of these minimally ramified series are determined by using the Fontaine–Wintenberger theory of the field of norms which allows an interpretation of them as automorphisms of ( Z ) p -extensions of local fields of characteristic zero. A particularly effective example illustrating the paper is given by a family of series generalizing Cebysev polynomials This paper discusses a family of non-linear sequence-to-sequence transformations designated as ek, ekm, ẽk, and ed. A brief history of the transforms is related and a simple motivation for the transforms is given. Examples are given of the application of these transformations to divergent and slowly convergent sequences. In particular the examples include numerical series, the power series of rational and meromorphic functions, and a wide variety of sequences drawn from continued fractions, integral equations, geometry, fluid mechanics, and number theory. Theorems are proven which show the effectiveness of the transformations both in accelerating the convergence of (some) slowly convergent sequences and in inducing convergence in (some) divergent sequences. The essential unity of these two motives is stressed. Theorems are proven which show that these transforms often duplicate the results of well-known, but specialized techniques. These special algorithms include Newton's iterative process, Gauss's numerical integration, an identity of Euler, the Pade Table, and Thiele's reciprocal differences. Difficulties which sometimes arise in the use of these transforms such as irregularity, non-uniform convergence to the wrong answer, and the ambiguity of multivalued functions are investigated. The concepts of antilimit and of the spectra of sequences are introduced and discussed. The contrast between discrete and continuous spectra and the consequent contrasting response of the corresponding sequences to the e1 transformation is indicated. The characteristic behaviour of a semiconvergent (asymptotic) sequence is elucidated by an analysis of its spectrum into convergent components of large amplitude and divergent components of small amplitude. We study compositions of the integer @math in which the first part, successive differences, and the last part are constrained to lie in prescribed sets @math , respectively. A simple condition on @math guarantees that the generating function @math has only a simple pole on its circle of convergence and this at @math , a function independent of @math and @math . Thus the number of compositions is asymptotic to @math for a suitable constant @math . We prove a multivariate central and local limit theorem and apply it to various statistics of random locally restricted compositions of @math , such as number of parts, numbers of parts of given sizes, and number of rises. The first and last parts are shown to have limiting distributions and to be asymptotically independent. If @math has only finitely many positive elements @math , or finitely many negative elements @math , then the largest part and number of distinct part sizes are almost surely @math . On the other hand, when both @math and @math have a positive asymptotic lower "local log-density", we prove that the largest part and number of distinct part sizes are almost surely @math , and we give sufficient conditions for the largest part to be almost surely asymptotic to @math . We explicitly compute the diverging factor in the large genus asymptotics of the Weil–Petersson volumes of the moduli spaces of n-pointed complex algebraic curves. Modulo a universal multiplicative constant we prove the existence of a complete asymptotic expansion of the Weil–Petersson volumes in the inverse powers of the genus with coefficients that are polynomials in n. This is done by analyzing various recursions for the more general intersection numbers of tautological classes, whose large genus asymptotic behavior is also extensively studied.