English

The L^1-norm of exponential sums in Z^d

Combinatorics 2013-09-10 v3 Classical Analysis and ODEs

Abstract

Let A be a finite set of integers and F_A its exponential sum. McGehee, Pigno & Smith and Konyagin have independently proved that the L^1-norm of F_A is at least c log|A| for some absolute constant c. The lower bound has the correct order of magnitude and was first conjectured by Littlewood. In this paper we present lower bounds on the L^1-norm of exponential sums of sets in the d-dimensional grid Z^d. We show that the L^1-norm of F_A is considerably larger than log|A| when A is a subset of Z^d with multidimensional structure. We furthermore prove similar lower bounds for sets in Z, which in a technical sense are multidimensional and discuss their connection to an inverse result on the theorem of McGehee, Pigno & Smith and Konyagin.

Keywords

Cite

@article{arxiv.1110.2014,
  title  = {The L^1-norm of exponential sums in Z^d},
  author = {Giorgis Petridis},
  journal= {arXiv preprint arXiv:1110.2014},
  year   = {2013}
}

Comments

13 pages. Section 5 has been modified. Conjecture 5.1 has been changed and is now called a question. The logarithmic lower bound on the L^1-norm of exponential sums of random sets in {1,...,N}^2 (Corollary 1.2 of version 1) is very weak and has been removed