Related papers: Finite and p-adic polylogarithms

The purpose of this note is to extend the results of V. Guillemin on elliptic self-adjoint pseudodifferential operators of order one, from operators defined on smooth functions on a closed manifold to operators defined on smooth sections in…

We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…

The classical $n$-variable Kloosterman sums over finite fields are well understood by Deligne's theorem from complex point of view and by Sperber's theorem from $p$-adic point of view. In this paper, we study the complex and $p$-adic…

For $f$ analytic and close to convex in $D=\{z: |z|< 1\}$, we give sharp estimates for the logarithmic coefficients $\gamma_{n}$ of $f$ defined by $\log \dfrac{f(z)}{z}=2\sum_{n=1}^{\infty} \gamma_{n}z^{n}$ when $n=1, 2,3$.

Let $\mathcal{A}$ denote the set of all analytic functions $f$ in the unit disk $\mathbb{D}:=\{z \in \mathbb{C}: |z| < 1\}$ normalized by $f (0) = 0$ and $f'(0) = 1.$ The logarithmic coefficients $\gamma_n$ of $f \in \mathcal{A}$ are…

In this paper we derive generalizations of different properties of monic polynomial families of binomial type, i.e. families of monic polynomials, for which the binomial theorem holds $$ p_n(\alpha+\beta)=\sum_{k=0}^n…

It is well known that not every summability property for non linear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to…

We study properties of coefficients of a linear form, originating from a multiple integral. As a corollary, we prove Vasilyev's conjecture, connected with the problem of irrationality of the Riemann zeta function at odd integers.

We develop ladders that reduce $\zeta(n):=\sum_{k>0}k^{-n}$, for $n=3,5,7,9,11$, and $\beta(n):=\sum_{k\ge0}(-1)^k(2k+1)^{-n}$, for $n=2,4,6$, to convergent polylogarithms and products of powers of $\pi$ and $\log2$. Rapid computability…

By $p$-adically interpolating the branching law for the spherical pair $\left(U_n, U_{n+1} \times U_{n}\right)$ of definite unitary groups, we construct a $p$-adic $L$-function attached to cohomological automorphic representations of…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…

The Witt algebra W_n is the Lie algebra of all derivations of the n-variable polynomial ring V_n=C[x_1, ..., x_n] (or of algebraic vector fields on A^n). A representation of W_n is polynomial if it arises as a subquotient of a sum of tensor…

Let $G$ be a finite $p$-group, and let $\der Gd$ denote the $d$-th term of the derived series of $G$. We show, for $p\geq 5$, that $\der Gd\neq 1$ implies $\log_p\ord G\geq 2^d+3d-6$, and hence we improve a recent result by Mann.

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

Let $k$ be any number field and $k_{\infty}/k$ any $\mathbb{Z}_p$-extension. We construct a natural $\Lambda= \mathbb{Z}_p[[ T-1 ]]$-morphism from $\varprojlim k_n^{\times} \otimes_{\mathbb{Z}} \mathbb{Z}_p$ into a special subset of…

The maximal degree over rational numbers that an n-dimensinonal Kloosterman sum defined over a finite field of characteristic p can achieve is known to be (p-1)/d where d=gcd(p-1,n+1). Wan has shown that this maximal degree is always…

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

We describe a more efficient algorithm to compute p-adic Coleman integrals on odd degree hyperelliptic curves for large primes p. The improvements come from using fast linear recurrence techniques when reducing differentials in…