Related papers: The sum of digits of polynomial values in arithmet…

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…

For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

We study a quantitative Ramsey-type problem on 3-term arithmetic progressions: how should the set of integers $[n] = \{1, 2, \dots, n\}$ be colored using 3 colors in order to maximize the number of rainbow 3-term arithmetic progressions? By…

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

Given a density t in (0,1], and a prime p, let S be any subset of F_p having at least tp elements, and having the least number of three-term arithmetic progressions mod p among all subsets of F_p with at least tp elements. Define N(t,p) to…

By the m-spectrum of a real number q>1 we mean the set Y^m(q) of values p(q) where p runs over the height m polynomials with integer coefficients. These sets have been extensively investigated during the last fifty years because of their…

We know that any prime number of form $4s+1$ can be written as a sum of two perfect square numbers. As a consequence of Goldbach's weak conjecture, any number great than $10$ can be represented as a sum of four primes. We are motivated to…

We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…

We derive polynomial identities of arbitrary degree $n$ for syzygies degrees of numerical semigroups S_m=<d_1,...,d_m> and show that for n>=m they contain higher genera G_r=\sum_{s\in Z_>\setminus S_m}s^r of S_m. We find a number…

Let $f(q)=a_rq^r+\cdots+a_sq^s$, with $a_r\neq 0$ and $a_s\neq 0$, be a real polynomial. It is a palindromic polynomial of darga $n$ if $r+s=n$ and $a_{r+i}=a_{s-i}$ for all $i$. Polynomials of darga $n$ form a linear subspace…

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

We study the existence of products of primes in arithmetic progressions, building on the work of Ramar\'e and Walker. One of our main results is that if $q$ is a large modulus, then any invertible residue class mod $q$ contains a product of…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

We prove an improvement on Schmidt's upper bound on the number of number fields of degree $n$ and absolute discriminant less than X for $6 \leq n \leq 94$. We carry this out by improving and applying a uniform bound on the number of monic…