中文
相关论文

相关论文: Unexpected local extrema for the Sendov conjecture

200 篇论文

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

数论 · 数学 2022-03-16 Dragan Stankov

Let $P(z)$ be a polynomial of degree $n$ having no zero in $|z|<k$ where $k\geq 1,$ then for every real or complex number $\alpha$ with $|\alpha|\geq 1$ it is known \begin{equation*} \underset{|z|=1}{\max}|D_\alpha P(z)|\leq…

复变函数 · 数学 2014-03-11 N. A. Rather , S. H. Ahangar , Suhail Gulzar

In this paper, we consider modular local polynomials. These functions satisfy modularity while they are locally defined as polynomials outside of an exceptional set. We prove an inequality for the dimension of the space of such forms when…

数论 · 数学 2014-05-06 Kathrin Bringmann , Ben Kane

In this paper, we obtain new results on the critical points of a polynomial, these results are useful to the Sendov conjecture.

复变函数 · 数学 2013-01-03 Zaizhao Meng

Two old conjectures from problem sections, one of which from SIAM Review, concern the question of finding distributions that maximize P(Sn <= t), where Sn is the sum of i.i.d. random variables X1, ..., Xn on the interval [0,1], satisfying…

概率论 · 数学 2008-08-13 Ludolf E. Meester

The standard well-known Remez inequality gives an upper estimate of the values of polynomials on $[-1,1]$ if they are bounded by $1$ on a subset of $[-1,1]$ of fixed Lebesgue measure. The extremal solution is given by the rescaled Chebyshev…

经典分析与常微分方程 · 数学 2020-07-06 B. Eichinger , P. Yuditskii

An important quantity associated with a complex polynomial $p(z)$ is $\Vert p \Vert_\infty$, the maximum of its modulus over the unit disc $D$. We prove, $z_* \in D$ is a local maximum of $|p(z)|$ if and only if $a_*$ satisfies,…

数值分析 · 计算机科学 2016-05-03 Bahman Kalantari

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

组合数学 · 数学 2016-06-07 Jesse Geneson

In the moduli space of degree d polynomials, the special subvarieties are those cut out by critical orbit relations, and then the special points are the post-critically finite polynomials. It was conjectured that in the moduli space of…

数论 · 数学 2016-03-18 Dragos Ghioca , Hexi Ye

We prove that for any degree d, there exist (families of) finite sequences a_0, a_1,..., a_d of positive numbers such that, for any real polynomial P of degree d, the number of its real roots is less than or equal to the number of the…

经典分析与常微分方程 · 数学 2016-10-31 J. Forsgård , D. Novikov , B. Shapiro

A Delaunay polytope $P$ is said to be {\em extreme} if the only (up to isometries) affine bijective transformations $f$ of $\R^n$, for which $f(P)$ is again a Delaunay polytope, are the homotheties. This notion was introduced in…

度量几何 · 数学 2007-05-23 M. Dutour

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

组合数学 · 数学 2008-07-02 Tali Kaufman , Shachar Lovett

The study of inner and cyclic functions in $\ell^p_A$ spaces requires a better understanding of the zeros of the so-called optimal polynomial approximants. We determine that a point of the complex plane is the zero of an optimal polynomial…

复变函数 · 数学 2021-04-19 Raymond Cheng , William T. Ross , Daniel Seco

Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

经典分析与常微分方程 · 数学 2009-10-23 F. Balogh , M. Bertola

We consider the problem of maximizing the sum of squares of the leading coefficients of polynomials $P_{i_1}(x),\ldots ,P_{i_m}(x)$ (where $P_j(x)$ is a polynomial of degree $j$) under the restriction that the sup-norm of $\sum_{j=1}^m…

经典分析与常微分方程 · 数学 2009-09-25 Holger Dette

We show that if the minimum entropy for a polynomial with roots on the unit circle is attained by polynomials with equally spaced roots, then, under a generic hypothesis about the nature of the extremum, the Krzyz conjecture on the maximum…

复变函数 · 数学 2018-03-28 Jim Agler , John E. McCarthy

Let $p_n$ be a random, degree $n$ polynomial whose roots are chosen independently according to the probability measure $\mu$ on the complex plane. For a deterministic point $\xi$ lying outside the support of $\mu$, we show that almost…

概率论 · 数学 2017-07-31 Sean O'Rourke , Noah Williams

This paper establishes an analog of the Erd\H{o}s-Ko-Rado theorem to polynomial rings over finite fields, affirmatively answering a conjecture of C. Tompkins. A $k$-uniform family of subsets of a set of finite size $n$ is $l$-intersecting…

数论 · 数学 2024-10-25 Nika Salia , Dávid Tóth

D. Dimitrov has posed the problem of finding polynomials that set the sharpness of the Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal. We disprove Dimitrov's conjecture for polynomials of degree 3,…

复变函数 · 数学 2019-04-26 Jimmy Dillies , Dmitriy Dmitrishin , Andrey Smorodin , Alex Stokolos