Asymptotic L^4 norm of polynomials derived from characters

From MaRDI portal
Publication:2393598

DOI10.2140/PJM.2013.263.373zbMATH Open1328.11031arXiv1205.1069OpenAlexW2964274079MaRDI QIDQ2393598FDOQ2393598

Daniel J. Katz

Publication date: 8 August 2013

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Abstract: Littlewood investigated polynomials with coefficients in 1,1 (Littlewood polynomials), to see how small their ratio of norms ||f||4/||f||2 on the unit circle can become as deg(f)oinfty. 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>1, a family of n-variable Littlewood polynomials with lower asymptotic ||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 ||f||4/||f||2 for multivariable polynomials f(z1,...,zn) is strictly less than what could be obtained by using products f1(z1)...fn(zn) of the best known univariate polynomials.


Full work available at URL: https://arxiv.org/abs/1205.1069




Recommendations









This page was built for publication: Asymptotic \(L^4\) norm of polynomials derived from characters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393598)