English
Related papers

Related papers: On the Hardy-Littlewood majorant problem

200 papers

We derive new matrix representation for higher order Daehee numbers and polynomials, the higher order lambda-Daehee numbers and polynomials and the twisted lambda-Daehee numbers and polynomials of order k. This helps us to obtain simple and…

Combinatorics · Mathematics 2015-03-03 B. S. El-Desouky , Abdelfattah Mustafa

The best known upper estimates for the constants of the Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}$ spaces are of the form $\left(\sqrt{2}\right) ^{m-1}.$ We present better estimates which depend on $p$ and $m$. An…

Functional Analysis · Mathematics 2015-10-08 Gustavo Araujo , Daniel Pellegrino , Diogo D. P. Silva e Silva

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 study $l^p$ operator norms of factorable matrices and related results. We give applications to $l^p$ operator norms of weighted mean matrices and Copson's inequalities. We also apply the method in this paper to study the best constant in…

Functional Analysis · Mathematics 2013-01-16 Peng Gao

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

Number Theory · Mathematics 2013-08-15 Alexei Entin

We provide a way to modify and to extend a previously established inequality by P. Erd\H{o}s, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central…

Number Theory · Mathematics 2010-10-18 Robert J Betts

We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…

Algebraic Geometry · Mathematics 2026-03-12 Colin Tan , Wing-Keung To

In this article we study two fundamental problems on exponential sums via randomization of frequencies with stochastic processes. These are the Hardy-Littlewood majorant problem, and $L^{2n}(\mathbb{T}), \ n\in \mathbb{N}$ norms of…

Classical Analysis and ODEs · Mathematics 2024-11-12 Faruk Temur , Cihan Sahillioğulları

Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, $$ that is,…

Combinatorics · Mathematics 2025-11-07 Yaara Jahn , Orit E. Raz

Suppose $F:=(f_1,\ldots,f_n)$ is a system of random $n$-variate polynomials with $f_i$ having degree $\leq\!d_i$ and the coefficient of $x^{a_1}_1\cdots x^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and variance…

Algebraic Geometry · Mathematics 2024-12-20 Grigoris Paouris , Kaitlyn Phillipson , J. Maurice Rojas

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

Number Theory · Mathematics 2013-07-23 P. B. Borwein , I. E. Pritsker

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Logic in Computer Science · Computer Science 2023-05-23 Donghyun Lim , Martin Ziegler

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

The Hardy--Littlewood inequality for $m$-homogeneous polynomials on $\ell_{p}$ spaces is valid for $p>m.$ In this note, among other results, we present an optimal version of this inequality for the case $p=m.$ We also show that the optimal…

Functional Analysis · Mathematics 2015-08-27 W. Cavalcante , D. Nunez-Alarcon , D. Pellegrino

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ are real numbers. We impose some restriction on the coefficients and then prove some extensions and…

Complex Variables · Mathematics 2016-09-27 Eze R. Nwaeze

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

The volume of the hive polytope (or polytope of honeycombs) associated with a Littlewood- Richardson coefficient of SU(n), or with a given admissible triple of highest weights, is expressed, in the generic case, in terms of the Fourier…

Representation Theory · Mathematics 2018-09-13 Robert Coquereaux , Jean-Bernard Zuber

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

Quantum Physics · Physics 2008-05-12 Andris Ambainis