English
Related papers

Related papers: Estimating the Koebe radius for polynomials

200 papers

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

Computational Complexity · Computer Science 2015-05-19 Zhixiang Chen , Bin Fu

We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…

Computational Physics · Physics 2009-10-31 Bogdan Mihaila , Ioana Mihaila

Let $S = k[x_{11}, \cdots, x_{1b_1}, \cdots, x_{n1}, \cdots, x_{nb_n}]$ be a polynomial ring in $m = b_1 + \cdots + b_n$ variables over a field $k$. For all $j$, $1\le j \le n$, let $P_j$ be the prime ideal generated by variables $\{x_{j1},…

Commutative Algebra · Mathematics 2016-07-06 Rahim Zaare-Nahandi

We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…

Functional Analysis · Mathematics 2009-11-10 Laurent Baratchart , Juliette Leblond , Fabien Seyfert

Let $n_1 < n_2 < \cdots < n_N$ be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials $T_N(\theta) = \sum_{j=1}^N {\cos (n_j\theta)}$ tends to $\infty$ as a…

Number Theory · Mathematics 2019-02-14 Tamás Erdélyi

We consider random trigonometric polynomials of the form \[ f_n(t):=\sum_{1\le k \le n} a_{k} \cos(kt) + b_{k} \sin(kt), \] whose entries $(a_{k})_{k\ge 1}$ and $(b_{k})_{k\ge 1}$ are given by two independent stationary Gaussian processes…

Probability · Mathematics 2017-06-07 Jürgen Angst , Federico Dalmao , Guillaume Poly

In the following, we study the minimization of polynomial potentials $ f(t) $ on the unit circle, where the potentials take the form \[ f(t) = \sum_{i=1}^n b_i x^{2i}, \quad b_i \in \mathbb{R}. \] This form arises in the context of…

General Mathematics · Mathematics 2025-01-22 Josiah Park

In this paper the author considers a particular type of polynomials with integer coefficients, consisting of a perfect power and two norm forms of abelian number fields with coprime discriminants. It is shown that such a polynomial…

Number Theory · Mathematics 2015-11-30 Jeongho Park

In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…

Number Theory · Mathematics 2020-11-11 Ankush Goswami , Venkata Raghu Tej Pantangi

In the polynomial ring $T=k[y_1,...,y_n]$, with $n>1$, we bound the multiplicity of homogeneous radical ideals $I\subset (y_1^{a_1},...,y_n^{a_n})$ such that $T/I$ is a graded $k$-algebra with Krull dimension one. As a consequence we solve…

Commutative Algebra · Mathematics 2011-10-05 Enrico Carlini , Maria Virginia Catalisano , Anthony V. Geramita

We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…

Classical Analysis and ODEs · Mathematics 2007-05-23 J. Koekoek , R. Koekoek

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…

Symbolic Computation · Computer Science 2014-08-19 Ye Liang

The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…

Dynamical Systems · Mathematics 2007-05-23 A. A. Glutsyuk , Yu. S. Ilyashenko

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

Number Theory · Mathematics 2016-05-25 Igor E. Shparlinski

This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…

Numerical Analysis · Mathematics 2021-01-19 Arvind K. Saibaba

First we consider the following problem which dates back to Chebyshev, Zolotarev and Achieser: among all trigonometric polynomials with given leading coefficients $a_0,...,a_l,$ $b_0,...,b_l \in \mathbb R$ find that one with least maximum…

Classical Analysis and ODEs · Mathematics 2010-01-05 Franz Peherstorfer

In this paper we derive some new identities involving the Fibonacci and Lucas polynomials and the Chebyshev polynomials of the first and the second kind. Our starting point is a finite trigonometric sum which equals the resolvent kernel on…

Number Theory · Mathematics 2024-03-20 Lejla Smajlović , Zenan Šabanac , Lamija Šćeta

We study residual polynomials, $R_{x_0,n}^{(\mathfrak{e})}$, $\mathfrak{e}\subset\mathbb{R}$, $x_0\in\mathbb{R}\setminus\mathfrak{e}$, which are the degree at most $n$ polynomials with $R(x_0)=1$ that minimize the $\sup$ norm on…

Classical Analysis and ODEs · Mathematics 2020-08-25 Jacob S. Christiansen , Barry Simon , Maxim Zinchenko

We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…

Optimization and Control · Mathematics 2019-09-02 Vera Roshchina , Nadia Sukhorukova , Julien Ugon