English
Related papers

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

200 papers

If $F$ is a polynomial with complex coefficients, leading term $a_N$, and roots $\alpha_1$, ..., $\alpha_N$, then Gon\c{c}alves' inequality states that $\|F\|_2^2$ is bounded below by $\abs{a_N}^2 (\prod_{n=1}^N \max\{1, \abs{\alpha_n}^2\}…

Classical Analysis and ODEs · Mathematics 2007-05-23 Peter Borwein , Michael J. Mossinghoff , Jeffrey D. Vaaler

Littlewood polynomials are polynomials with each of their coefficients in {-1,1}. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Complex Variables · Mathematics 2014-06-10 Tamas Erdelyi

It is shown that Erd\"{o}s--Littlewood's polynomials are not $L^\alpha$-flat when $\alpha > 2$ is an even integer (and hence for any $\alpha \geq 4$). This provides a partial solution to an old problem posed by Littlewood. Consequently, we…

Classical Analysis and ODEs · Mathematics 2025-05-01 el Houcein el Abdalaoui

Let $f = \sum_{k=0}^n \varepsilon_k z^k$ be a random polynomial, where $\varepsilon_0,\ldots ,\varepsilon_n$ are iid standard Gaussian random variables, and let $\zeta_1,\ldots,\zeta_n$ denote the roots of $f$. We show that the point…

Probability · Mathematics 2020-10-22 Marcus Michelen , Julian Sahasrabudhe

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

Number Theory · Mathematics 2022-03-16 Dragan Stankov

Let A be a finite set of integers and F_A its exponential sum. McGehee, Pigno & Smith and Konyagin have independently proved that the L^1-norm of F_A is at least c log|A| for some absolute constant c. The lower bound has the correct order…

Combinatorics · Mathematics 2013-09-10 Giorgis Petridis

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

Combinatorics · Mathematics 2008-07-02 Tali Kaufman , Shachar Lovett

The approximate non-deterministic degree of a Boolean function $f$, denoted $\mathsf{ndeg}_\epsilon(f)$ (written $\mathsf{N}_\epsilon(f)$ for brevity), is the minimum degree of a real polynomial $p$ such that $0 \le |p(x)| \le \epsilon$…

Computational Complexity · Computer Science 2026-05-25 Samruddhi Pednekar , Supartha Podder

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

Let $P(z)=\sum_{n=0}^Na_nz^n$ be a Littlewood polynomial of degree $N$, meaning that $a_n\in\{\pm 1\}$. We say that $P$ is reciprocal if $P(z)=z^NP(1/z)$. Borwein, Erd\'elyi and Littmann posed the question of determining the minimum number…

Classical Analysis and ODEs · Mathematics 2023-12-08 Benjamin Bedert

We generalize a previous inequality related to a sharp version of the Littlewood conjecture on the minimal $L_1$-norm of $N$-term exponential sums $f$ on the unit circle. The new result concerns replacing the expression $\log(1+t|f|^2)$…

Classical Analysis and ODEs · Mathematics 2011-01-11 Ivo Klemes

We prove two-sided estimates for the best (i.e., the smallest possible) constant $\,c_n(\alpha)\,$ in the Markov inequality $$ \|p_n'\|_{w_\alpha} \le c_n(\alpha) \|p_n\|_{w_\alpha}\,, \qquad p_n \in {\cal P}_n\,. $$ Here, ${\cal P}_n$…

Classical Analysis and ODEs · Mathematics 2017-11-21 Geno Nikolov , Rumen Uluchev

We establish that the set of pairs $(\alpha, \beta)$ of real numbers such that $$ \liminf_{q \to + \infty} q \cdot (\log q)^2 \cdot \Vert q \alpha \Vert \cdot \Vert q \beta \Vert > 0, $$ where $\Vert \cdot \Vert$ denotes the distance to the…

Number Theory · Mathematics 2009-05-07 Yann Bugeaud , Nikolay Moshchevitin

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Number Theory · Mathematics 2024-07-03 Cheuk Fung Lau

Let $P(z)$ be a polynomial of degree $n,$ then it is known that for $\alpha\in\mathbb{C}$ with $|\alpha|\leq \frac{n}{2},$ \begin{align*} \underset{|z|=1}{\max}|\left|zP^{\prime}(z)-\alpha P(z)\right|\leq…

Complex Variables · Mathematics 2024-12-02 N. A. Rather , Aijaz Bhat , Suhail Guzlar

In a celebrated paper, Borwein, Erd\'elyi, Ferguson and Lockhart constructed cosine polynomials of the form \[ f_A(x) = \sum_{a \in A} \cos(ax), \] with $A\subseteq \mathbb{N}$, $|A|= n$ and as few as $n^{5/6+o(1)}$ zeros in $[0,2\pi]$,…

Classical Analysis and ODEs · Mathematics 2021-02-10 Tomas Juškevičius , Julian Sahasrabudhe

For any given real number $\alpha$ with bounded partial quotients, we construct explicitly continuum many real numbers $\beta$ with bounded partial quotients for which the pair $(\alpha, \beta)$ satisfies a strong form of the Littlewood…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

We use a non-linear characterization of orthonormal polynomials due to Saff in order to show that the behavior of orthonormal polynomials is determined only by its leading coefficient and its normalization. Several applications of this…

Spectral Theory · Mathematics 2021-08-11 Brian Simanek

We prove that for polynomials $f, g, h \in \mathbb{Z}[x]$ satisfying $f = gh$ and $f(0) \neq 0$, the $\ell_2$-norm of the cofactor $h$ is bounded by $\|h\|_2 \leq \|f\|_1 \cdot\left( \widetilde{O}\left(\|g\|_0^3 \frac{\text{deg…

Symbolic Computation · Computer Science 2026-04-01 Ido Nahshon , Amir Shpilka

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

Computational Complexity · Computer Science 2015-08-11 Hing Yin Tsang , Ning Xie , Shengyu Zhang