English
Related papers

Related papers: On the Hardy-Littlewood majorant problem

200 papers

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

Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…

Computational Complexity · Computer Science 2012-07-11 Jin-Yi Cai , Pinyan Lu , Mingji Xia

The Hardy--Littlewood inequality for complex homogeneous polynomials asserts that given positive integers $m\geq2$ and $n\geq1$, if $P$ is a complex homogeneous polynomial of degree $m$ on $\ell_{p}^{n}$ with $2m\leq p\leq\infty$ given by…

Functional Analysis · Mathematics 2015-10-08 Gustavo Araujo , Daniel Pellegrino

We generalize a semi-norm for the Alexander polynomial of a connected, compact, oriented 3-manifold on its first cohomology group to a semi-norm for an arbitrary Laurent polynomial f on the dual vector space to the space of exponents of f.…

Algebraic Topology · Mathematics 2008-08-08 David G. Long

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

I investigate on the number t of real eigenvectors of a real symmetric tensor. In particular, given a homogeneous polynomial f of degree d in 3 variables, i prove that t is greater or equal than 2c+1, if d is odd and t is greater or equal…

Algebraic Geometry · Mathematics 2016-12-16 Mauro Maccioni

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

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

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

Holant problems are a general framework to study the computational complexity of counting problems. It is a more expressive framework than counting constraint satisfaction problems (CSP) which are in turn more expressive than counting graph…

Computational Complexity · Computer Science 2025-04-22 Jin-Yi Cai , Jin Soo Ihm

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Number Theory · Mathematics 2007-05-23 H. A. Helfgott

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

Classical Analysis and ODEs · Mathematics 2023-01-02 Leonidas Daskalakis

Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Number Theory · Mathematics 2007-05-23 H. A. Helfgott

The resolvent degree $\textrm{rd}_{\mathbb{C}}(n)$ is the smallest integer $d$ such that a root of the general polynomial $$f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$$ can be expressed as a composition of algebraic functions in at most $d$…

Algebraic Geometry · Mathematics 2024-06-25 Oakley Edens , Zinovy Reichstein

We propose an algebraic geometry framework for the Kakeya problem. We conjecture that for any polynomials $f,g\in\F_{q_0}[x,y]$ and any $\F_q/\F_{q_0}$, the image of the map $\F_q^3\to\F_q^3$ given by $(s,x,y)\mapsto…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov

The aim of this paper is to exhibit a wide class of sparse deterministic sets, $\mathbf B \subseteq \mathbb{N}$, so that \[ \limsup_{N \to \infty} N^{-1}|\mathbf B \cap [1,N]|= 0, \] for which the Hardy--Littlewood majorant property holds:…

Classical Analysis and ODEs · Mathematics 2015-05-05 Ben Krause , Mariusz Mirek , Bartosz Trojan

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

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

Classical Analysis and ODEs · Mathematics 2019-07-23 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…

Combinatorics · Mathematics 2026-05-14 Colin McSwiggen , Siddhartha Sahi