English
Related papers

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

200 papers

We consider the problem of existence of polynomials with small norm. This range of problems has been extensively studied by many authors in the case of the unit circle (or a compact Abelian group), i.e. when the characters are bounded. In…

Functional Analysis · Mathematics 2015-05-12 A. Kushpel

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

Computational Complexity · Computer Science 2019-10-08 Srikanth Srinivasan , Utkarsh Tripathi , S. Venkitesh

Orthogonal polynomials on the unit circle are completely determined by their reflection coefficients through the Szeg\H{o} recurrences. We assume that the reflection coefficients converge to some complex number a with 0 < |a| < 1. The…

Classical Analysis and ODEs · Mathematics 2016-09-06 Leonid B. Golinskii , Paul G. Nevai , Walter Van Assche

Cilleruelo conjectured that if $f\in\mathbb{Z}[x]$ of degree $d\ge 2$ is irreducible over the rationals, then $\log\operatorname{lcm}(f(1),\ldots,f(N))\sim(d-1)N\log N$ as $N\to\infty$. He proved it for the case $d = 2$. Very recently,…

Number Theory · Mathematics 2019-11-06 Ashwin Sah

Let $k_i\ (i=1,2,\ldots,t)$ be natural numbers with $k_1>k_2>\cdots>k_t>0$, $k_1\geq 2$ and $t<k_1.$ Given real numbers $\alpha_{ji}\ (1\leq j\leq t,\ 1\leq i\leq s)$, we consider polynomials of the shape…

Number Theory · Mathematics 2023-05-16 Kiseok Yeon

Let $w_{\alpha}(t)=t^{\alpha}\,e^{-t}$, $\alpha>-1$, be the Laguerre weight function, and $|\cdot|_{w_\alpha}$ denote the associated $L_2$-norm, i.e., $$ | f|_{w_\alpha}:=\Big(\int_{0}^{\infty}w_{\alpha}(t)| f(t)|^2\,dt\Big)^{1/2}. $$…

Classical Analysis and ODEs · Mathematics 2016-05-10 Geno Nikolov , Alexei Shadrin

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

Number Theory · Mathematics 2017-03-10 Shuntaro Yamagishi

We establish a generalization of Littlewood's criterion on $L^\alpha$-flatness by proving that there is no $L^\alpha$-flat polynomials, $\alpha>0$, within the class of analytic polynomials on the unit circle of the form $…

Number Theory · Mathematics 2025-09-05 el Houcein el Abdalaoui

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

Number Theory · Mathematics 2018-04-20 Alexander Dunn , Nicolas Robles

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

The Littlewood Conjecture states that liminf_{q\to \infty} q . ||qx|| . ||qy|| = 0 for all pairs (x,y) of real numbers. We show that with the additional factor of log q . loglog q the statement is false. Indeed, our main result implies that…

Number Theory · Mathematics 2014-01-14 Dzmitry Badziahin

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

Algebraic Geometry · Mathematics 2009-06-03 A. I. Molev

We consider the semi-classical generalized Freud weight function \[w_{\lambda}(x;t) = |x|^{2\lambda+1}\exp(-x^4 +tx^2),\qquad x\in\mathbb{R},\] with $ \lambda>-1$ and $t\in\mathbb{R}$ parameters. We analyze the asymptotic behavior of the…

Exactly Solvable and Integrable Systems · Physics 2017-11-07 Peter A Clarkson , Kerstin Jordaan

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

We argue that Jack Littlewood-Richardson coefficients $g_{\mu\nu}^{\lambda}(\alpha)$ are specialisations of certain novel polynomials. For the triple of partitions $(\mu,\nu,\lambda)=(21,21,321)$, we prove the corresponding polynomial is…

Combinatorics · Mathematics 2026-05-12 Ryan Mickler

Recent work of Borwein, Choi, and the second author examined a collection of polynomials closely related to the Goldbach conjecture: the polynomial $F_N$ is divisible by the $N$th cyclotomic polynomial if and only if there is no…

Number Theory · Mathematics 2010-08-12 Greg Martin , Charles L. Samuels

Let $A\subset \mathbf{N}$ be a finite set of $n=|A|$ positive integers, and consider the cosine sum $f_A(x)=\sum_{a\in A}\cos ax$. We prove that $$\min_x f_A(x)\leqslant -n^{ 1/7-o(1)},$$ thereby establishing polynomial bounds for the…

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

In this paper, we develop a quantitative inverse theory for the Gowers uniformity norm $\|\cdot\|_{\mathsf{U}^4}$ in general finite abelian groups. We identify a new type of obstructions to uniformity, which we call almost-cubic…

Combinatorics · Mathematics 2026-01-06 Luka Milićević

We verify that $\liminf_{q\to\infty} q\cdot |q|_p\cdot ||qx||<\epsilon$ for all real $x$, small primes $p$ and relatively small $\epsilon$. This result supports the famous $p$-adic Littlewood conjecture which states that the above lower…

Number Theory · Mathematics 2025-06-23 Dmitry Badziahin

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov
‹ Prev 1 3 4 5 6 7 10 Next ›