Asymptotic L^4 norm of polynomials derived from characters
From MaRDI portal
Publication:2393598
DOI10.2140/PJM.2013.263.373zbMATH Open1328.11031arXiv1205.1069OpenAlexW2964274079MaRDI QIDQ2393598FDOQ2393598
Publication date: 8 August 2013
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Abstract: Littlewood investigated polynomials with coefficients in (Littlewood polynomials), to see how small their ratio of norms on the unit circle can become as . 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 , a family of -variable Littlewood polynomials with lower asymptotic 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 for multivariable polynomials is strictly less than what could be obtained by using products of the best known univariate polynomials.
Full work available at URL: https://arxiv.org/abs/1205.1069
Recommendations
Polynomials in number theory (11C08) Special sequences and polynomials (11B83) Trigonometric polynomials, inequalities, extremal problems (42A05) Other character sums and Gauss sums (11T24)
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)