English
Related papers

Related papers: On the Hardy-Littlewood majorant problem

200 papers

We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three…

Computational Complexity · Computer Science 2026-04-09 Robin Kothari , Matt Kovacs-Deak , Daochen Wang , Rain Zimin Yang

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

Computational Complexity · Computer Science 2017-05-11 Shuichi Hirahara

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

Number Theory · Mathematics 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by…

Number Theory · Mathematics 2007-05-23 Ben Green

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

Complex Variables · Mathematics 2024-03-20 Olga Katkova , Boris Shapiro , Anna Vishnyakova

$\operatorname{Holant}^*(f)$ denotes a class of counting problems specified by a constraint function $f$. We prove complexity dichotomy theorems for $\operatorname{Holant}^*(f)$ in two settings: (1) $f$ is any arity-3 real-valued function…

Computational Complexity · Computer Science 2023-08-01 Yin Liu , Austen Z. Fan , Jin-Yi Cai

A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…

Number Theory · Mathematics 2015-04-01 Christopher Marks

A Littlewood polynomial is a polynomial of the form \[ f_n(x)=\sum_{k=0}^n \varepsilon_k x^k \] with $\varepsilon_k\in\{-1, 1\}$. Let $(\varepsilon_k)_{k \ge 0}$ be i.i.d. Rademacher coefficients. We show that the lower envelope of…

Probability · Mathematics 2026-05-12 Brayden Letwin , Mehtaab Sawhney

This paper is a continuation of [1], in which I studied Harvey Friedman's problem of whether the function f(x,y) = x^2 + y^3 satisfies any identities; however, no knowledge of [1] is necessary to understand this paper. We will break the…

General Mathematics · Mathematics 2009-10-13 Roger Tian

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

Complex Variables · Mathematics 2008-01-16 John P. D'Angelo , Jiri Lebl , Han Peters

Let $w_{\lambda}(t)=(1-t^2)^{\lambda-1/2}$, $\lambda>-1/2$, be the Gegenbauer weight function, and $\Vert\cdot\Vert$ denote the associated $L_2$-norm, i.e., $$ \Vert f\Vert:=\Big(\int_{-1}^{1}w_{\lambda}(t)\vert f(t)\vert^2\,dt\Big)^{1/2}.…

Classical Analysis and ODEs · Mathematics 2015-10-13 Alexei Shadrin , Geno Nikolov , Dragomir Aleksov

Consider a system of two polynomial equations in two variables: $$F(X,Y)=G(X,Y)=0$$ where $F \in \rr[X,Y]$ has degree $d \geq 1$ and $G \in \rr[X,Y]$ has $t$ monomials. We show that the system has only $O(d^3t+d^2t^3)$ real solutions when…

Computational Complexity · Computer Science 2014-07-24 Pascal Koiran , Natacha Portier , Sébastien Tavenas

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

Algebraic Geometry · Mathematics 2013-09-03 Kaitlyn Phillipson , J. Maurice Rojas

Given $f\in \mathbb{Z}[t]$ of positive degree, we investigate the existence of auxiliary polynomials $g\in \mathbb{Z}[t]$ for which $f(g(t))$ factors as a product of polynomials of small relative degree. One consequence of this work shows…

Number Theory · Mathematics 2017-10-06 Jonathan Bober , Dan Fretwell , Greg Martin , Trevor D. Wooley

We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function $f = [x_0, x_1, x_2, x_3]$, we prove that the bipartite Holant…

Computational Complexity · Computer Science 2020-11-19 Austen Z. Fan , Jin-Yi Cai

Any homogeneous harmonic polynomial can be decomposed as a sum of powers of isotropic linear forms, that is, linear forms whose coefficients are the coordinates of isotropic points. The minimum size of such decompositions for a harmonic…

Algebraic Geometry · Mathematics 2025-12-08 S. Canino , C. Flavi

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

In this paper, we will give suitable conditions on differential polynomials $Q(f)$ such that they take every finite non-zero value infinitely often, where $f$ is a meromorphic function in complex plane. These results are related to Problem…

Complex Variables · Mathematics 2020-03-20 Ta Thi Hoai An , Nguyen Viet Phuong

A Newman polynomial has all the coefficients in $\{ 0,1\}$ and constant term 1, whereas a Littlewood polynomial has all coefficients in $\{-1,1\}$. We call $P(X)\in\mathbb{Z}[X]$ a Borwein polynomial if all its coefficients belong to $\{…

Number Theory · Mathematics 2016-09-26 Paulius Drungilas , Jonas Jankauskas , Jonas Šiurys

A Hardy-Littlewood triple is a 3-tuple of integers with the form $(n, n+2, n+6)$. In this paper, we study Hardy-Littlewood triples of the form $(p, P_{a}, P_{b})$ and improve the upper and lower bound orders of it, where $p$ is a prime and…

Number Theory · Mathematics 2024-01-04 Runbo Li
‹ Prev 1 3 4 5 6 7 10 Next ›