Related papers: On the Distribution of Pseudopowers

We prove a power saving over the local bound for the sup norm of Hecke-Maass forms on any quasi-split semisimple real group that is not isogenous to a product of odd special unitary groups.

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional…

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Waring's problem has a long history in additive number theory. In its original form it deals with the representability of every positive integer as sum of $k$-th powers with integer $k$. Instead of these powers we deal with…

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

We prove that any multiplicative subgroup G of the prime field f_p with |G| < p^{1/2} satisfies |3G| \gg |G|^2 / \log |G|. Also, we obtain a bound for the multiplicative energy of any nonzero shift of G, namely E^* (G+x) \ll |G|^2 log |G|,…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

We show that the reductions modulo primes $p\le x$ of the elliptic curve $$ Y^2 = X^3 + f(a)X + g(b), $$ behave as predicted by the Lang-Trotter and Sato-Tate conjectures, on average over integers $a \in [-A,A]$ and $b \in [-B,B]$ for $A$…

Let $p$ be a prime, and let $k,n,m,n_0$ and $m_0$ be nonnegative integers such that $k\ge 1$, and $_0$ and $m_0$ are both less than $p$. K. Davis and W. Webb established that for a prime $p\ge 5$ the following variation of Lucas' Theorem…

Let $\omega_0, \omega_1,\ldots, \omega_n$ be a full set of outcomes (letters, symbols) and let positive $p_i$, $i=0,\ldots,n$, be their probabilities ($\sum_{i=0}^n p_i=1$). Let us treat $\omega_0$ as a stop symbol; it can occur in…

The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes…

Let $q_1, \ldots , q_t$ be distinct prime numbers. Let $a_1, \ldots , a_t$ be nonnegative integers. We establish effective lower bounds for $|z^d - q_1^{a_1} \ldots q_t^{a_t}|$ and for its greatest prime factor, which tend to infinity with…

If the prime numbers are pseudo-randomly distributed, then analogy with quantum systems suggests that counting primes might be modeled by a non-homogeneous Poisson process. Consequently, postulating underlying gamma statistics, more-or-less…

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

A number $n$ is practical if every integer in $[1,n]$ can be expressed as a subset sum of the positive divisors of $n$. We consider the distribution of practical numbers that are also shifted primes, improving a theorem of Guo and…

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…