Related papers: New bound on small range sum polynomials of degree

In the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv \lambda\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large…

We extend the classical Burgess estimates to character sums over proper generalized arithmetic progressions (GAPs) of rank $2$ in prime fields $\mathbb{F}_p$. The core of our proof is a sharp upper bound for the multiplicative energy of…

We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

We bound from below the number of shifted primes p+s<x that have a divisor in a given interval (y,z]. Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the…

Let $p$ be a prime number and $\left(\frac{\cdot}{p}\right)$ be the Legendre symbol modulo $p$. The \emph{Legendre path} attached to $p$ is the polygonal path whose vertices are the normalized character sums $\frac{1}{\sqrt{p}} \sum_{n\leq…

We prove {\em sign equidistribution} of Legendre polynomials: the ratio between the lengths of the regions in the interval $[-1, 1]$ where the Legendre polynomial assumes positive versus negative values, converges to one as the degree…

The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…

The evaluations of determinants with Legendre symbol entries have close relation with character sums over finite fields. Recently, Sun posed some conjectures on this topic. In this paper, we prove some conjectures of Sun and also study some…

We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.

In this paper, we investigate an upper bound of the polar derivative of a polynomial of degree $n$ $$p(z)=(z-z_m)^{t_m} (z-z_{m-1})^{t_{m-1}}\cdots (z-z_0)^{t_0}(a_0+\sum\limits_{\nu=\mu} ^{n-(t_m+\cdots+t_0)} a_{\nu}z^\nu)$$ where zeros…

We restrict the possibilities for the character degrees of $p$-groups $G$ satisfying $|G:G'| = p^2$. E.g. if $G$ is of maximal class and has an irreducible character of degree $> p$, then it has such a character of degree at most…

The main goal of this paper is to characterize limit key polynomials for a valuation $\nu$ on $K[x]$. We consider the set $\Psi_\alpha$ of key polynomials for $\nu$ of degree $\alpha$. We set $p$ be the exponent characteristic of $\nu$. Our…

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

In this paper, we study the value sets of non-permutation polynomial functions over the residue class ring $\mathbb{Z}/m\mathbb{Z}$. When $m=p^r$ is a power of some prime $p$, an upper bound is given for the size of the value set of a…

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…