Related papers: Inequalities for Multivariate Polynomials
The file contains PhD Dissertation by Oskar Jakub Szyma\'nski. This work ends his study at Doctoral School of Exact and Natural Sciences at Jagiellonian University where the Author has attended in years 2019-2024. The subject of the Thesis…
We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…
We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…
We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…
In the framework of mapped pseudospectral methods, we introduce a new polynomial-type mapping function in order to describe accurately the dynamics of systems developing almost singular structures. Using error criteria related to the…
In this paper we show that the weighted Bernstein-Walsh inequality in logarithmic potential theory is sharp up to some new universal constant, provided that the external field is given by a logarithmic potential. Our main tool for such…
We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
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…
The purpose of this paper is to study the Schwarz-Pick type inequalities for harmonic or pluriharmonic functions. By analogy with the generalized Khavinson conjecture, we first give some sharp estimates of the norm of harmonic functions…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…
The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coefficients and small norms on $[0,1]$ to give a Chebyshev-type lower bound in prime number theory. We study a generalization of this method for…
We give a survey of recent results, due mainly to the authors, concerning Bernstein-Markov type inequalities and connections with potential theory.
In this sequel to arxiv:arXiv:1012.0835 we develop Bezout type theorems for semidegrees (including an explicit formula for {\em iterated semidegrees}) and an inequality for subdegrees. In addition we prove (in case of surfaces) a Bernstein…
We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these…
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…
The present work draws on the understanding how notions of general potential theory - as set up, e.g., by Fuglede - explain existence and some basic results on the "magical" rendezvous numbers. We aim at a fairly general description of…
We obtain strong converse inequalities for the Bernstein polynomials with explicit asymptotic constants. We give different estimation procedures in the central and non-central regions of [0,1]. The main ingredients in our approach are the…