English

Asymptotic $L^4$ norm of polynomials derived from characters

Number Theory 2012-10-23 v2 Information Theory Combinatorics math.IT

Abstract

Littlewood investigated polynomials with coefficients in {1,1}\{-1,1\} (Littlewood polynomials), to see how small their ratio of norms f4/f2||f||_4/||f||_2 on the unit circle can become as deg(f)deg(f)\to\infty. A small limit is equivalent to slow growth in the mean square autocorrelation of the associated binary sequences of coefficients of the polynomials. The autocorrelation problem for arrays and higher dimensional objects has also been studied; it is the natural generalization to multivariable polynomials. Here we find, for each n>1n > 1, a family of nn-variable Littlewood polynomials with lower asymptotic f4/f2||f||_4/||f||_2 than any known hitherto. We discover these through a wide survey, infeasible with previous methods, of polynomials whose coefficients come from finite field characters. This is the first time that the lowest known asymptotic ratio of norms f4/f2||f||_4/||f||_2 for multivariable polynomials f(z1,...,zn)f(z_1,...,z_n) is strictly less than what could be obtained by using products f1(z1)...fn(zn)f_1(z_1)... f_n(z_n) of the best known univariate polynomials.

Keywords

Cite

@article{arxiv.1205.1069,
  title  = {Asymptotic $L^4$ norm of polynomials derived from characters},
  author = {Daniel J. Katz},
  journal= {arXiv preprint arXiv:1205.1069},
  year   = {2012}
}

Comments

23 pages, corrects errata in and makes small adjustments to previous version

R2 v1 2026-06-21T20:58:55.336Z