Related papers: Hensel's Lemma, Backward Dynamics and p-adic Appro…

We will study p-adic invariant integerals involving trigonometric functions

The inverse problem which arises in the Camassa--Holm equation is revisited for the class of discrete densities. The method of solution relies on the use of orthogonal polynomials. The explicit formulas are obtained directly from the…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

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…

In the context of convex optimization problems in Hilbert spaces, we induce inertial effects into the classical ADMM numerical scheme and obtain in this way so-called inertial ADMM algorithms, the convergence properties of which we…

We prove the modulo $p$ and modulo $p^2$ cases of Igusa's conjecture on exponential sums. This conjecture predicts specific uniform bounds in the homogeneous polynomial case of exponential sums modulo $p^m$ when $p$ and $m$ vary. We…

Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

We show that the inverse problems for a class of kinetic equations can be solved by classical tools in PDE analysis including energy estimates and the celebrated averaging lemma. Using these tools, we give a unified framework for the…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.

We establish the existence of liftings into discrete subspaces of $\mathbf{H}(\mathrm{div})$ of piecewise polynomial data on locally refined simplicial partitions of polygonal/polyhedral domains. Our liftings are robust with respect to the…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

This article discusses variants of Weber's class number problem in the spirit of arithmetic topology to connect the results of Sinnott--Kisilevsky and Kionke. Let $p$ be a prime number. We first prove the $p$-adic convergence of class…

Let $p$ be a prime number. We develop a theory of $p$-adic Mahler measure of polynomials and apply it to the study of $\mathbb{Z}$-covers of rational homology 3-spheres branched over links. We obtain a $p$-adic analogue of the asymptotic…

We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…

Using the theory of $(\phi,\Gamma)$-modules and the formalism of Selmer complexes we construct the p-adic height for p-adic representations with coefficients in an affinoid algebra over $Q_p$.

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

Motivated by the Langlands program in representation theory, number theory and geometry, the theory of representations of a reductive $p$-adic group over a coefficient ring different from the field of complex numbers has been widely…