Quasi-random multilinear polynomials

Gil Kalai, Leonard J. Schulman*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We consider multilinear Littlewood polynomials, polynomials in n variables in which a specified set of monomials U have ±1 coefficients, and all other coefficients are 0. We provide upper and lower bounds (which are close for U of degree below log n) on the minimum, over polynomials h consistent with U, of the maximum of |h| over ±1 assignments to the variables. (This is a variant of a question posed by Erdős regarding the maximum on the unit disk of univariate polynomials of given degree with unit coefficients.) We outline connections to the theory of quasi-random graphs and hypergraphs, and to statistical mechanics models. Our methods rely on the analysis of the Gale–Berlekamp game; on the constructive side of the generic chaining method; on a Khintchine-type inequality for polynomials of degree greater than 1; and on Bernstein’s approximation theory inequality.

Original languageEnglish
Pages (from-to)195-211
Number of pages17
JournalIsrael Journal of Mathematics
Volume230
Issue number1
DOIs
StatePublished - 1 Mar 2019

Bibliographical note

Publisher Copyright:
© 2019, The Hebrew University of Jerusalem.

Fingerprint

Dive into the research topics of 'Quasi-random multilinear polynomials'. Together they form a unique fingerprint.

Cite this