Related papers: Local and global methods in arithmetic (in Russian…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
Poincar\'e series of $p$-adic, definable equivalence relations have been studied in various cases since Igusa's and Denef's work related to counting solutions of polynomial equations modulo $p^n$ for prime $p$. General semi-algebraic…
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…
The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. We have discovered an infinite congruence family for $d_5(n)$ modulo powers of 5.…
The local to global principle for densities is a very convenient tool proposed by Poonen and Stoll to compute the density of a given subset of the integers. In this paper we provide an effective criterion to find all higher moments of the…
Online and stochastic gradient methods have emerged as potent tools in large scale optimization with both smooth convex and nonsmooth convex problems from the classes $C^{1,1}(\reals^p)$ and $C^{1,0}(\reals^p)$ respectively. However to our…
We show one possible dynamical approach to the study of the distribution of prime numbers. Our approach is based on two complexity methods, the Computable Information Content and the Entropy Information Gain, looking for analogies between…
We overview a series of recent works addressing numerical simulations of partial differential equations in the presence of some elements of randomness. The specific equations manipulated are linear elliptic, and arise in the context of…
We are concerned with interior and global gradient estimates for solutions to a class of singular quasilinear elliptic equations with measure data, whose prototype is given by the $p$-Laplace equation $-\Delta_p u=\mu$ with $p\in (1,2)$.…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
A $p$-adic modification of the split-LBG classification method is presented in which first clusterings and then cluster centers are computed which locally minimise an energy function. The outcome for a fixed dataset is independent of the…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
Number types for exact computation are usually based on directed acyclic graphs. A poor graph structure can impair the efficency of their evaluation. In such cases the performance of a number type can be drastically improved by…
Let $G=(V,E)$ be a locally finite graph. Firstly, using calculus of variations, including a direct method of variation and the mountain-pass theory, we get sequences of solutions to several local equations on $G$ (the Schr\"odinger…
Using continuation methods and bifurcation theory, we study the exact multiplicity of periodic solutions, and the global solution structure, for periodic problems of first order. The results are applied to a population model with fishing,…
We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…
Grothendieck point residue is considered in the context of computational complex analysis. A new effective method is proposed for computing Grothendieck point residues mappings and residues. Basic ideas of our approach are the use of…
Let $p$ be a prime greater than $3$ and let $a$ be a rational p-adic integer. In this paper we try to determine $\sum_{k=1}^{[p/3]}\binom{3k}ka^k\pmod p$, and real the connection between cubic congruences and the sum…
We present an approach to the computation of confluent systems of defining relations in associative conformal algebras based on the similar technique for modules over ordinary associative algebras.
The concept of a universal algorithm is discussed. Examples of this kind of algorithms are presented. Software implementations of such algorithms in C++ type languages are discussed together with means that provide for computations with an…