English
Related papers

Related papers: Norming Sets and Related Remez-type Inequalities

200 papers

Bernstein's classical inequality asserts that given a trigonometric polynomial $T$ of degree $n\geq1$, the sup-norm of the derivative of $T$ does not exceed $n$ times the sup-norm of $T$. We present various approaches to prove this…

Classical Analysis and ODEs · Mathematics 2019-03-27 Hervé Queffélec , Rachid Zarouf

We obtain local estimates, also called propagation of smallness or Remez-type inequalities, for analytic functions in several variables. Using Carleman estimates, we obtain a three sphere-type inequality, where the outer two spheres can be…

Complex Variables · Mathematics 2023-03-06 Walton Green , Nathan Wagner

We improve Mahler's lower bound for the Mahler measure in terms of the discriminant and degree for a specific class of polynomials: complex monic polynomials of degree $d\geq 2$ such that all roots with modulus greater than some fixed value…

Number Theory · Mathematics 2023-09-19 Murray Child , Martin Widmer

Let $R_j$ denote the $j^{\text{th}}$ Riesz transform on $\mathbb{R}^n$. We prove that there exists an absolute constant $C>0$ such that \begin{align*} |\{|R_jf|>\lambda\}|\leq C\left(\frac{1}{\lambda}\|f\|_{L^1(\mathbb{R}^n)}+\sup_{\nu}…

Classical Analysis and ODEs · Mathematics 2020-07-29 Daniel Spector , Cody B. Stockdale

Let $\Re_n$ be the set of all rational functions of the type $r(z) = p(z)/w(z),$ where $p(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-a_j)$, $|a_j|>1$ for $1\leq j\leq n$. In this paper, we set up some results…

Complex Variables · Mathematics 2026-02-03 N. A. Rather , Tanveer Bhat , Danish Rashid Bhat

Given a $d$-tuple $T$ of commuting contractions on Hilbert space and a polynomial $p$ in $d$-variables, we seek upper bounds for the norm of the operator $p(T)$. Results of von Neumann and And\^o show that if $d=1$ or $d=2$, the upper bound…

Functional Analysis · Mathematics 2024-11-08 Michael Hartz

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

Number Theory · Mathematics 2025-09-10 Kiseok Yeon

The set ${\cal P}^{m\times n}_{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min \{m, n\}-1$, we show that ${\cal…

Numerical Analysis · Mathematics 2016-12-14 Andrii Dmytryshyn , Froilán M. Dopico

Given a finite Borel measure $\mu$ on R n and basic semi-algebraic sets $\Omega$\_i $\subset$ R n , i = 1,. .. , p, we provide a systematic numerical scheme to approximate as closely as desired $\mu$(\cup\_i $\Omega$\_i), when all moments…

Optimization and Control · Mathematics 2017-06-27 Jean Lasserre , Youssouf Emin

Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…

Metric Geometry · Mathematics 2022-06-06 Matthieu Fradelizi , Mokshay Madiman , Artem Zvavitch

The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…

Optimization and Control · Mathematics 2020-01-28 Vu Trung Hieu

Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…

Number Theory · Mathematics 2024-05-22 James Leng

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

Optimization and Control · Mathematics 2015-09-09 Etienne de Klerk , Monique Laurent , Zhao Sun

We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…

Number Theory · Mathematics 2014-06-11 Tamas Erdelyi

We prove Nikol'skii type inequalities which for polynomials on the $n$-dimensional torus $\mathbb{T}^n$ relate the $L^p$-with the $L^q$-norm (with respect to the normalized Lebesgue measure and $0 <p <q < \infty$). Among other things we…

Functional Analysis · Mathematics 2015-08-25 Andreas Defant , Mieczysław Mastyło

Let $f$ be an analytic polynomial of degree at most $K-1$. A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity. Many extensions…

Functional Analysis · Mathematics 2025-01-27 Lars Becker , Ohad Klein , Joseph Slote , Alexander Volberg , Haonan Zhang

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

Commutative Algebra · Mathematics 2021-08-05 Francesca Gandini

A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C…

Discrete Mathematics · Computer Science 2019-03-22 Jake Wellens

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

Algebraic Geometry · Mathematics 2019-03-19 Nathália Moraes de Oliveira , Enric Nart

Let $d \geq 4$ be a natural number and let $A$ be a finite, non-empty subset of $\mathbb{R}^d$ such that $A$ is not contained in a translate of a hyperplane. In this setting, we show that \[ |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg)…

Combinatorics · Mathematics 2022-12-01 Akshat Mudgal