相关论文: Modular forms and $p$-adic numbers (in Russian)

Several authors have recently proved results which express cusp forms as $p$-adic limits of weakly holomorphic modular forms under repeated application of Atkin's $U$-operator. The proofs involve techniques from the theory of weak harmonic…

The harmonic number $H_k=\sum_{j=1}^k1/j(k=1,2,3\cdots)$ play an important role in mathematics. Let $p>3$ be a prime. In this paper, we establish a number of congruences with the form $\sum_{k=1}^{p-1}k^mH_k^n(\mod p^2)$ for…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

In this paper we present a probabilistic algorithm to compute the coefficients of modular forms of level one. Focus on the Ramanujan's tau function, we give out the explicit complexity of the algorithm. From a practical viewpoint, the…

In this paper we prove some transformation formulae for congruences modulo a prime and deduce some congruences for Domb numbers and Almkvist-Zudilin numbers. We also pose some conjectures on congruences modulo prime powers.

In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…

This introductory paper studies a class of real analytic functions on the upper half plane satisfying a certain modular transformation property. They are not eigenfunctions of the Laplacian and are quite distinct from Maass forms. These…

We use the system of p-adic numbers for the description of information processes. Basic objects of our models are so called transformers of information, basic processes are information processes, the statistics are information statistics…

Nous donnons une nouvelle description de la matrice de logarithme d'une forme modulaire en termes de distributions, g\'en\'eralisant le travail de Dion et Lei pour le cas $a_p=0$. Ce qui nous permet d'inclure le cas $a_p\ne 0$ est une…

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

Summation of a large class of the functional series, which terms contain factorials, is considered. We first investigated finite partial sums for integer arguments. These sums have the same values in real and all p-adic cases. The…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

For a normalized newform $g \in S_{k}(\Gamma_{0}(N))$ with complex multiplication by an imaginary quadratic field $K$, there is a mock modular form $F^{+}$ corresponding to $g$. K. Bringmann et al. modified $F^{+}$ in order to obtain a…

Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…

A notion of heaps of modules as an affine version of modules over a ring or, more generally, over a truss, is introduced and studied. Basic properties of heaps of modules are derived. Examples arising from geometry (connections, affine…

In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

Modular units are functions on modular curves whose divisors are supported on the cusps. They form a free abelian group of rank at most one less than the number of cusps. In this paper we study the group of modular units on $X_{1}( p )$,…