English
Related papers

Related papers: Littlewood Polynomials with Small $L^4$ Norm

200 papers

Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…

Combinatorics · Mathematics 2020-08-11 Matthew Kwan , Lisa Sauermann

In this paper we study the average $\NL_{2\alpha}$-norm over $T$-polynomials, where $\alpha$ is a positive integer. More precisely, we present an explicit formula for the average $\NL_{2\alpha}$-norm over all the polynomials of degree…

Number Theory · Mathematics 2016-09-07 T. Mansour

A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Yuan Xu

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-09-18 Alexei Entin

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…

Classical Analysis and ODEs · Mathematics 2019-02-07 Julian Sahasrabudhe

Let $Z(N)$ denote the minimum number of zeros in $[0,2\pi]$ that a cosine polynomial of the form $$f_A(t)=\sum_{n\in A}\cos nt$$ can have when $A$ is a finite set of non-negative integers of size $|A|=N$. It is an old problem of Littlewood…

Classical Analysis and ODEs · Mathematics 2025-01-09 Benjamin Bedert

Let H(N) denote the set of all polynomials with positive integer coefficients which have their zeros in the open left half-plane. We are looking for polynomials in H(N) whose largest coefficients are as small as possible and also for…

Complex Variables · Mathematics 2013-08-02 Albrecht Boettcher

We exhibit a class of Littlewood polynomials that are not $L^\alpha$-flat for any $\alpha \geq 0$. Indeed, it is shown that the sequence of Littlewood polynomials is not $L^\alpha$-flat, $\alpha \geq 0$, when the frequency of $-1$ is not in…

Number Theory · Mathematics 2017-05-11 E. H. el Abdalaoui , M. G. Nadkarni

We study $\{0, 1\}$ and $\{-1, 1\}$ polynomials $f(z)$, called Newman and Littlewood polynomials, that have a prescribed number $N(f)$ of zeros in the open unit disk $\mathcal{D} = \{z \in \mathbb{C}: |z| < 1\}$. For every pair $(k, n) \in…

Number Theory · Mathematics 2019-10-31 Kevin G. Hare , Jonas Jankauskas

For a finite set of natural numbers $D$ consider a complex polynomial of the form $f(z) = \sum_{d \in D} c_d z^d$. Let $\rho_+(f)$ and $\rho_-(f)$ be the fractions of the unit circle that $f$ sends to the right($\operatorname{Re} f(z) > 0$)…

Classical Analysis and ODEs · Mathematics 2024-08-22 Abdulamin Ismailov

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-01-07 Alexei Entin , Sean Landsberg

Let p be a prime, and let f : Z/pZ -> R be a function with average value 0 and ||f||_A <= 1, where ||f||_A denotes the algebra norm (L^1 norm of the Fourier transform). Then f(x) is small for some x, specifically min_x |f(x)| is no more…

Classical Analysis and ODEs · Mathematics 2007-05-23 Ben Green , Sergei Konyagin

Polynomials with all the coefficients in $\{ 0,1\}$ and constant term 1 are called Newman polynomials, whereas polynomials with all the coefficients in $\{ -1,1\}$ are called Littlewood polynomials. By exploiting an algorithm developed…

Number Theory · Mathematics 2018-05-09 P. Drungilas , J. Jankauskas , G. Junevičius , L. Klebonas , J. Šiurys

The aim of this paper is to give an overview of some inequalities about $L^p$-norms ($p= 1$ or $p= 2$) of harmonic (periodic) and non-harmonic trigonometric polynomials. Among the material covered, we mention Ingham's Inequality about 2…

Classical Analysis and ODEs · Mathematics 2023-11-30 Philippe Jaming , Chadi Saba

Consider a trigonometric polynomial f of degree N, and associate to it the polynomial F in which each coefficient of f is replaced by its absolute value. F is called the majorant of f. We show that the L^3 norm of f can be larger than that…

Classical Analysis and ODEs · Mathematics 2009-11-10 Ben Green , Imre Ruzsa

It is shown that the $L^\alpha$-norms polynomials Rudin conjecture fails. Our counterexample is inspired by Bourgain's work on NLS. Precisely, his study of the Strichartz's inequality of the $L^6$-norm of the periodic solutions given by the…

Classical Analysis and ODEs · Mathematics 2021-10-13 el Houcein el Abdalaoui

In this paper we associate to each multivariate polynomial $f$ that is homogeneous relative to a subset of its variables a series of polynomial families $P_\lambda (f)$ of $m$-tuples of homogeneous polynomials of equal degree such that the…

Computational Complexity · Computer Science 2017-08-03 Hông Vân Lê

Let f in Q[z] be a polynomial of degree d at least two. The associated canonical height \hat{h}_f is a certain real-valued function on Q that returns zero precisely at preperiodic rational points of f. Morton and Silverman conjectured in…

Number Theory · Mathematics 2008-12-03 Robert L. Benedetto , Benjamin Dickman , Sasha Joseph , Benjamin Krause , Daniel Rubin , Xinwen Zhou

We prove that the Littlewood conjecture is satisfied for a restricted class of pairs $(\alpha,\beta)$ of badly approximable numbers. We use the localization of the roots of a cubic equation with coefficients depending on the diophantine…

Number Theory · Mathematics 2025-04-22 Youssef Lazar

If f(x_1, x_2, ..., x_n) is a polynomial dependent on a large number of independent Bernoulli random variables, what can be said about the maximum concentration of f on any single value? For linear polynomials, this reduces to one version…

Probability · Mathematics 2015-07-03 Kevin P. Costello