English
Related papers

Related papers: A quadratic approximation to the Sendov radius nea…

200 papers

Littlewood polynomials are polynomials with each of their coefficients in $\{-1,1\}$. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Classical Analysis and ODEs · Mathematics 2023-11-09 Tamás Erdélyi

Let S(n,0) be the set of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ denote by $|p|_{0}$ the distance from the origin to the zero set of $p'$. We…

Complex Variables · Mathematics 2007-05-23 Julius Borcea

A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…

Classical Analysis and ODEs · Mathematics 2014-02-27 Geno Nikolov

For $K$ a cubic field with only one real embedding and $\alpha,\beta\in K$, we show how to construct an increasing sequence $\{m_n\}$ of positive integers and a subsequence $\{\psi_n\}$ such that (for some constructible constants…

Number Theory · Mathematics 2014-12-15 Dustin Hinkel

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

For parameters $\,c\in(0,1)\,$ and $\,\beta>0$, let $\,\ell_{2}(c,\beta)\,$ be the Hilbert space of real functions defined on $\,\mathbb{N}\,$ (i.e., real sequences), for which $$ \| f \|_{c,\beta}^2 :=…

Classical Analysis and ODEs · Mathematics 2020-07-09 Dimitar K. Dimitrov , Geno P. Nikolov

In this paper, we obtain new results on the critical points of a polynomial. We discuss the Sendov conjecture for polynomials of degree nine.

Complex Variables · Mathematics 2013-03-12 Zaizhao Meng

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

Functional Analysis · Mathematics 2020-05-19 Malik Saad Al-Muhja , Habibulla Akhadkulov , Nazihah Ahmad

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…

Complex Variables · Mathematics 2025-08-05 Álfheiður Edda Sigurðardóttir

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

Probability · Mathematics 2008-02-29 Terence Tao , Van Vu

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

Optimization and Control · Mathematics 2022-09-08 Dogyoon Song , Pablo A. Parrilo

The fastest known algorithm for factoring a degree $n$ univariate polynomial over a finite field $\mathbb{F}_q$ runs in time $O(n^{3/2 + o(1)}\text{polylog } q)$, and there is a reason to believe that the $3/2$ exponent represents a…

Data Structures and Algorithms · Computer Science 2025-11-17 Chris Umans , Siki Wang

This paper provides a complete proof of Simon-Lukic conjecture for orthogonal polynomials on the unit circle. For a probability measure $d\mu = w(\theta) \frac{d\theta}{2\pi} + d\mu_s$ with Verblunsky coefficients…

Spectral Theory · Mathematics 2026-01-27 Daxiong Piao

Consider $n$ runners running on a circular track of unit length with constant speeds such that $k$ of the speeds are distinct. We show that, at some time, there will exist a sector $S$ which contains at least $|S|n+ \Omega(\sqrt{k})$…

Computational Complexity · Computer Science 2020-04-07 Pavel Hrubes

Let $X_1, \ldots , X_n$ be i.i.d. random vectors in $\mathbb{R}^d$ with $\|X_1\| \le \beta$. Then, we show that $\frac{1}{\sqrt{n}}(X_1 + \ldots + X_n)$ converges to a Gaussian in quadratic transportation (also known as "Kantorovich" or…

Probability · Mathematics 2017-07-25 Alex Zhai

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

Probability · Mathematics 2020-03-02 Gil Kur

Let $T_\beta$ be the $\beta$-transformation on $[0,1)$ defined by $$T_\beta(x)=\beta x\text{ mod }1.$$ We study the Diophantine approximation of the orbit of a point $x$ under $T_\beta$. Precisely, for given two positive functions…

Dynamical Systems · Mathematics 2019-07-31 Wanlou Wu , Lixuan Zheng

In this work we are interested in the Demyanov--Ryabova conjecture for a finite family of polytopes. The conjecture asserts that after a finite number of iterations (successive dualizations), either a 1-cycle or a 2-cycle eventually comes…

Optimization and Control · Mathematics 2017-09-07 Aris Daniilidis , Colin Petitjean

A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.

Numerical Analysis · Mathematics 2007-05-23 Borislav Bojanov , Yuan Xu