Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2006, Journal of the European Mathematical Society
The purpose of this paper is to investigate efficient representations of the residue classes modulo q, by performing sum and product set operations starting from a given subset A of Z q. We consider the case of very small sets A and composite q for which not much seemed known (nontrivial results were recently obtained when q is prime or when log |A| ∼ log q). Roughly speaking we show that all residue classes are obtained from a k-fold sum of an r-fold product set of A, where r log q and log k log q, provided the residue sets π q (A) are large for all large divisors q of q. Even in the special case of prime modulus q, some results are new, when considering large but bounded sets A. It follows for instance from our estimates that one can obtain r as small as r ∼ log q/ log |A| with similar restriction on k, something not covered by earlier work of Konyagin and Shparlinski. On the technical side, essential use is made of Freiman's structural theorem on sets with small doubling constant. Taking for A = H a possibly very small multiplicative subgroup, bounds on exponential sums and lower bounds on min a∈Z * q max x∈H ax/q are obtained. This is an extension to the results obtained by Konyagin, Shparlinski and Robinson on the distribution of solutions of x m = a (mod q) to composite modulus q.
We show that for any ε > 0 and a sufficiently large cube-free q, any reduced residue class modulo q can be represented as a product of 14 integers from the interval [1, q 1/4e 1/2 +ε ]. The length of the interval is at the lower limit of what is possible before the Burgess bound on the smallest quadratic nonresidue is improved. We also consider several variations of this result and give applications to Fermat quotients.
Canadian Mathematical Bulletin
For any prime p, let $y(p)$ denote the smallest integer y such that every reduced residue class (mod p) is represented by the product of some subset of $\{1,\dots ,y\}$ . It is easy to see that $y(p)$ is at least as large as the smallest quadratic nonresidue (mod p); we prove that $y(p) \ll _\varepsilon p^{1/(4 \sqrt e)+\varepsilon }$ , thus strengthening Burgess’ classical result. This result is of intermediate strength between two other results, namely Burthe’s proof that the multiplicative group (mod p) is generated by the integers up to $O_\varepsilon (p^{1/(4 \sqrt e)+\varepsilon })$ , and Munsch and Shparlinski’s result that every reduced residue class (mod p) is represented by the product of some subset of the primes up to $O_\varepsilon (p^{1/(4 \sqrt e)+\varepsilon })$ . Unlike the latter result, our proof is elementary and similar in structure to Burgess’ proof for the least quadratic nonresidue.
2019
Let p be a prime number. In [1], Booker and Pomerance find an integer y with 1 < y ≤ p such that all non-zero residue classes modulo p can be written as a square-free product of positive integers up to y. Let us denote by y(p) the smallest such y. Booker and Pomerance show in their paper that except for p = 5 and 7, we have y(p) ≤ y and some better upper bounds were conjectured. Later, Munsch and Shparlinski [7] proved those conjectures with even better localization. Their work was done as the same time as ours, but with fairly more complicated methods in the proof. We were seeking to find a solution for the problem using Pólya-Vinogradov inequality or at most its improvement, the Burgess bound on character sums. That being said, we removed the condition in the problem that the product has to be square-free. We proved that for m > p √ , each residue class b of (Z/pZ)× can be written as a product of elements of the set {1, 2, . . . ,m} modulo p. In fact, we showed that the numb...
JOURNAL-AMERICAN MATHEMATICAL …, 2004
GAFA Geometric And Functional Analysis, 2006
In this paper we extend the exponential sum results from [B-K] and [B-G-K] for prime moduli to composite moduli q involving a bounded number of prime factors. In particular, we obtain nontrivial bounds on the exponential sums associated to multiplicative subgroups H of size q δ , for any given δ > 0. The method consists in first establishing a 'sum-product theorem' for general subsets A of Z q. If q is prime, the statement, proven in [B-K-T], expresses simply that, either the sumset A + A or the product-set A.A is significantly larger than A, unless |A| is near q. For composite q, the presence of nontrivial subrings requires a more complicated dichotomy, which is established here. With this sum-product theorem at hand,the methods from [B-G-K] may then be adapted to the present context with composite moduli. They rely essentially on harmonic analysis and graph-theoretical results such as Gowers' quantitative version of the Balog-Szemeredi theorem. As a corollary,we do get nontrivial bounds for the 'Heilbronn-type' exponential sums when q = p r (p prime) for all r. Only the case r = 2 had been treated earlier in works of Heath-Brown and Heath-Brown and Konyagin (using Stepanov's method). We also get exponential sum estimates for (possibly incomplete) sums involving exponential functions, as considered for instance in [Konyagin-Shparlinski] §0. Introduction.
Contemporary Mathematics
For a given polynomial G we study the sums φm(n) := ∑′km and φG(n) = ∑′G(k) where m ≥ 0 is a fixed integer and ∑′ runs through all integers k with 1 ≤ k ≤ n and gcd(k, n) = 1. Although, for m ≥ 1 the function φm is not multiplicative, analogue to the Euler function we obtain expressions for φm(n) and φG(n). Also, we estimate the averages ∑n≤x φm(n) and ∑n≤xφG(n), as more as, the alternative averages ∑n≤x(−1)n−1φm(n) and ∑n≤x(−1)n−1φG(n).
Journal of Combinatorial Theory, Series A, 2001
1 2 BABAI, FRANKL, KUTIN,ŠTEFANKOVIČ
Let 2 q ≥ be a positive integer and () q S n be the sum of the digits in basis q of the positive integer. n We prove that the quotient () () n n ω Ω has a normal order one, where () n ω and () n Ω are respectively, the number of distinct prime factors and the number of prime factors p of a positive integer n counted with multiplicity such that () q
We show that the large sieve is optimal for almost all exponential sums.
Duke Mathematical Journal, 2011
We prove that if for a finite set A of integers we have |A + A| ≤ K|A|, then A is contained in a generalized arithmetic progression of dimension at most K 1+C(log K) −1/2 and size at most exp(K 1+C(log K) −1/2)|A| for some absolute constant C. We also discuss a number of applications of this result.
Given positive integers a1,. .. , a k , we prove that the set of primes p such that p ≡ 1 mod ai for i = 1,. .. , k admits asymptotic density relative to the set of all primes which is at least k i=1 1 − 1 ϕ(a i) , where ϕ is the Euler's totient function. This result is similar to the one of Heilbronn and Rohrbach, which says that the set of positive integer n such that n ≡ 0 mod ai for i = 1,. .. , k admits asymptotic density which is at least k i=1
Acta Mathematica, 1998
Journal d'Analyse Mathématique, 2014
We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square-free moduli and also on the result due to Gallagher and Iwaniec when the core q ′ = p|q p of the modulus q satisfies log q ′ ∼ log q. Some applications to zero free regions of Dirichlet L-functions and the Pólya and Vinogradov inequalities are indicated. In this paper we will discuss short character sums for moduli with small prime factors. In particular, we will revisit the arguments of Graham-Ringrose [GR] and Postnikov [P]. Our main result is an estimate valid for general moduli, which improves on the known estimates in certain situations. It is well known that non-trivial estimates on short character sums are important to many number theoretical issues. In particular, they are relevant in establishing density theorems for the corresponding Dirichlet L-functions. In the literature, several bounds on short incomplete character sums to some modulus q may be found, depending on the nature of q. Burgess' bound applies for moduli q that are cube free, provided the summation interval I has size N ≫ q 1 4 +ǫ . Assuming q has small prime factors, nontrivial estimates may * 2000 Mathematics Subject Classification. 11L40, 11M06.
Journal of the American Mathematical Society
An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such a covering of the integers, then the least member of S is also bounded, thus confirming a conjecture of Erdos and Selfridge. We also prove a conjecture of Erdos and Graham, that, for each fixed number K>1, the complement in the integers of any union of residue classes r(n) mod n, for distinct n in (N,KN], has density at least d_K for N sufficiently large. Here d_K is a positive number depending only on K. Either of these new results implies another conjecture of Erdos and Graham, that if S is a finite set of moduli greater than N, with a choice for residue classes r(n) mod n for n in S which covers the integers, then the largest member of S cannot be O(N). We further obtain stronger forms of these results and establish other information, includ...
2008
Let $\Z/pZ$ be the finite field of prime order $p$ and $A$ be a subsequence of $\Z/pZ$. We prove several classification results about the following questions: (1) When can one represent zero as a sum of some elements of $A$ ? (2) When can one represent every element of $\Z/pZ$ as a sum of some elements of $A$ ? (3) When can one represent every element of $\Z/pZ$ as a sum of $l$ elements of $A$ ?
Comptes Rendus Mathematique, 2003
Our first result is a 'sum-product' theorem for subsets A of the finite field F p , p prime, providing a lower bound on max(|A + A|, |A · A|). As corollary, the second and main result provides new bounds on exponential sums associated to subgroups of the multiplicative group F
Acta Arithmetica, 2005
The Ramanujan Journal, 2005
Duke Mathematical Journal, 2007
In this paper we consider the problem of finding upperbounds on the minimum norm of representatives in residue classes in quotient O/I, where I is an integral ideal in the maximal order O of a number field K. In particular, we answer affirmatively a question of Konyagin and Shparlinski, stating that an upperbound o(N (I)) holds for most ideals I, denoting N (I) the norm of I. More precise statements are obtained, especially when I is prime. We use the method of exponential sums over multiplicative groups, exploiting essentially the new bounds obtained by the methods in [BC1] and [BC2]. Introduction. Let I be an integral ideal in an algebraic number field K. For a residue class α ∈ O/I, denote by N I (α) the minimal norm of all elements of α. Thus N I (α) = min x∈α |N (x)|. (0.1) Following [KS] (Chapter 9), we define further L(K, I) = max α∈(O/I) * N I (α).
2015
A set A = Ak,n ⇢ [n] [ {0} is said to be an additive k-basis if each element in {0, 1, . . . , kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple representations as k-sums, and given any function (n) ! 1, we say that A is said to be a truncated (n)-representative k-basis for [n] if for each j 2 [↵n, (k ↵)n] the number of ways that j can be represented as a k-sum of elements of Ak,n is ⇥( (n)). In this paper, we follow tradition and focus on the case (n) = log n, and show that a randomly selected set in an appropriate probability space is a truncated log-representative basis with probability that tends to one as n!1. This result is a finite version of a result proved by Erdős and extended by Erdős and Tetali.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.