270 research outputs found

    Iterated Sumsets and Subsequence Sums

    Full text link
    Let GZ/m1Z××Z/mrZG\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z be a finite abelian group with m1mr=exp(G)m_1\mid\ldots\mid m_r=\exp(G). The Kemperman Structure Theorem characterizes all subsets A,BGA,\,B\subseteq G satisfying A+B<A+B|A+B|<|A|+|B| and has been extended to cover the case when A+BA+B|A+B|\leq |A|+|B|. Utilizing these results, we provide a precise structural description of all finite subsets AGA\subseteq G with nA(A+1)n3|nA|\leq (|A|+1)n-3 when n3n\geq 3 (also when GG is infinite), in which case many of the pathological possibilities from the case n=2n=2 vanish, particularly for large nexp(G)1n\geq \exp(G)-1. The structural description is combined with other arguments to generalize a subsequence sum result of Olson asserting that a sequence SS of terms from GG having length S2G1|S|\geq 2|G|-1 must either have every element of GG representable as a sum of G|G|-terms from SS or else have all but G/H2|G/H|-2 of its terms lying in a common HH-coset for some HGH\leq G. We show that the much weaker hypothesis SG+exp(G)|S|\geq |G|+\exp(G) suffices to obtain a nearly identical conclusion, where for the case HH is trivial we must allow all but G/H1|G/H|-1 terms of SS to be from the same HH-coset. The bound on S|S| is improved for several classes of groups GG, yielding optimal lower bounds for S|S|. We also generalize Olson's result for G|G|-term subsums to an analogous one for nn-term subsums when nexp(G)n\geq \exp(G), with the bound likewise improved for several special classes of groups. This improves previous generalizations of Olson's result, with the bounds for nn optimal.Comment: Revised version, with results reworded to appear less technica

    Almost all primes have a multiple of small Hamming weight

    Full text link
    Recent results of Bourgain and Shparlinski imply that for almost all primes pp there is a multiple mpmp that can be written in binary as mp=1+2m1++2mk,1m1<<mk,mp= 1+2^{m_1}+ \cdots +2^{m_k}, \quad 1\leq m_1 < \cdots < m_k, with k=66k=66 or k=16k=16, respectively. We show that k=6k=6 (corresponding to Hamming weight 77) suffices. We also prove there are infinitely many primes pp with a multiplicative subgroup A=FpA=\subset \mathbb{F}_p^*, for some g{2,3,5}g \in \{2,3,5\}, of size Ap/(logp)3|A|\gg p/(\log p)^3, where the sum-product set AA+AAA\cdot A+ A\cdot A does not cover Fp\mathbb{F}_p completely

    Transfer of Fourier multipliers into Schur multipliers and sumsets in a discrete group

    Full text link
    We inspect the relationship between relative Fourier multipliers on noncommutative Lebesgue-Orlicz spaces of a discrete group and relative Toeplitz-Schur multipliers on Schatten-von-Neumann-Orlicz classes. Four applications are given: lacunary sets; unconditional Schauder bases for the subspace of a Lebesgue space determined by a given spectrum, that is, by a subset of the group; the norm of the Hilbert transform and the Riesz projection on Schatten-von-Neumann classes with exponent a power of 2; the norm of Toeplitz Schur multipliers on Schatten-von-Neumann classes with exponent less than 1.Comment: Corresponds to the version published in the Canadian Journal of Mathematics 63(5):1161-1187 (2011
    corecore