Related papers: Families of p-adic fields

In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…

We establish existence theorems for the image of the normalized character map of the $p$-adic Heisenberg algebra $S$ taking values in the algebra of Serre $p$-adic modular forms $M_p$. In particular, we describe the construction of an…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

We relate $p$-adic families of Jacobi forms to Big Heegner points constructed by B. Howard, in the spirit of the Gross-Kohnen-Zagier theorem. We view this as a GL(2) instance of a $p$-adic Kudla program.

We prove a dynamical version of the Mordell-Lang conjecture for subvarieties of the affine space A^g over a p-adic field, endowed with polynomial actions on each coordinate of A^g. We use analytic methods similar to the ones employed by…

We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with…

There are countless sources of data available to governments, companies, and citizens, which can be combined for good or evil. We analyse the concepts of combining data from common sources and linking data from different sources. We model…

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

This paper proposes a new approach for approximate evaluation of #P-hard queries with probabilistic databases. In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each…

In this paper we study the $p$-adic equation $x^q=a$ over the field of $p$-adic numbers. We construct an algorithm of calculation of criteria of solvability in the case of $q=p^m$ and present a computer program to compute the criteria for…

We calculate extensions between certain irreducible admissible representations of p-adic groups.

We give a brief re-exposition of the theory due to Pauli and Sinclair of ramification polygons of Eisenstein polynomials over p-adic fields, their associated residual polynomials and an algorithm to produce all extensions for a given…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Let $A$ be a Dedekind domain, $K$ the fraction field of $A$, and $f\in A[x]$ a monic irreducible separable polynomial. For a given non-zero prime ideal $\mathfrak{p}$ of $A$ we present in this paper a new method to compute a…

In the paper, using the extended fermionic $p$-adic integral on $\mathbb{Z}_p$, the authors find some applications of the umbral calculus. From these applications, the authors derive some identities on the weighted Euler numbers and…

We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

In this paper, using $p$-adic analysis and $p$-adic L-functions, we show how to extend classical congruences (due to Wilson, Gauss, Dirichlet, Jacobi, Wolstenholme, Glaisher, Morley, Lemher and other people) to modulo $p^k$ for any $k>0$.

Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…

The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo $p$ of a semi-stable $\Q_p$-representation of the absolute Galois group of a $p$-adic field (\emph{i.e.} a finite…