English
Related papers

Related papers: Least multivariate Chebyshev polynomials on diagon…

200 papers

Thiran and Detaille give an explicit formula for the asymptotics of the sup-norm of the Chebyshev polynomials on a circular arc. We give the so-called $\textrm{Szeg\H o}$-Widom asymptotics for this domain, i.e., explicit expressions for the…

Classical Analysis and ODEs · Mathematics 2016-07-26 Benjamin Eichinger

We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve…

Metric Geometry · Mathematics 2015-09-23 Tamás Erdélyi , Douglas P. Hardin , Edward B. Saff

A new Chebyshev-type family of stabilized explicit methods for solving mildly stiff ODEs is presented. Besides conventional conditions of order and stability we impose an additional restriction on the methods: their stability function must…

Numerical Analysis · Mathematics 2025-04-02 Boris Faleichik , Andrew Moisa

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

Combinatorics · Mathematics 2022-05-09 Sven Polak

We study the problem of robust multivariate polynomial regression: let $p\colon\mathbb{R}^n\to\mathbb{R}$ be an unknown $n$-variate polynomial of degree at most $d$ in each variable. We are given as input a set of random samples…

Data Structures and Algorithms · Computer Science 2024-03-15 Vipul Arora , Arnab Bhattacharyya , Mathews Boban , Venkatesan Guruswami , Esty Kelman

In this work, we discuss the problem of approximating a multivariate function by discrete least squares projection onto a polynomial space using a specially designed deterministic point set. The independent variables of the function are…

Numerical Analysis · Mathematics 2014-01-07 Tao Zhou , Akil Narayan , Zhiqiang Xu

Consider the problem, usually called the P\'olya-Chebotarev problem, of finding a continuum in the complex plane including some given points such that the logarithmic capacity of this continuum is minimal. We prove that each connected…

Complex Variables · Mathematics 2013-06-27 Klaus Schiefermayr

In this paper, we prove super-polynomial lower bounds for the model of \emph{sum of ordered set-multilinear algebraic branching programs}, each with a possibly different ordering ($\sum \mathsf{smABP}$). Specifically, we give an explicit…

Computational Complexity · Computer Science 2024-02-20 Prerona Chatterjee , Deepanshu Kush , Shubhangi Saraf , Amir Shpilka

We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…

Algebraic Geometry · Mathematics 2015-07-07 Denis Simon , Martin Weimann

We construct a simple closed-form representation of degree-ordered system of bivariate Chebyshev-I orthogonal polynomials $\mathscr{T}_{n,r}(u,v,w)$ on simplicial domains. We show that these polynomials $\mathscr{T}_{n,r}(u,v,w),$…

Classical Analysis and ODEs · Mathematics 2015-10-30 Mohammad A. AlQudah

We consider a generalization of the Cheeger problem in a bounded, open set $\Omega$ by replacing the perimeter functional with a Finsler-type surface energy and the volume with suitable powers of a weighted volume. We show that any…

Functional Analysis · Mathematics 2018-06-12 Giorgio Saracco

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

Complex Variables · Mathematics 2008-04-15 Milan Janjic

Every homogeneous Riemannian C_0-space (N,g) is associated with its minimal polynomial. To provide explicit examples, we compute the minimal polynomials for generalized Heisenberg groups equipped with their canonical left-invariant metrics.

Differential Geometry · Mathematics 2026-01-14 Tillmann Jentsch

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

Number Theory · Mathematics 2018-01-04 Anish Ghosh , Alexander Gorodnik , Amos Nevo

In this paper we consider the minimal polynomial $\psi_n(x)$ of $2\cos (2\pi /n)$. We introduce some polynomial sequences with the same recurrence relation as the rescaled Chebyshev polynomials $t_n(x)=2\, T_n(x/2)$ of the first kind, which…

General Mathematics · Mathematics 2025-04-25 Mamoru Doi

In the theory of orthogonal polynomials, as well as in its intersection with harmonic analysis, it is an important problem to decide whether a given orthogonal polynomial sequence $(P_n(x))_{n\in\mathbb{N}_0}$ satisfies nonnegative…

Classical Analysis and ODEs · Mathematics 2024-06-07 Stefan Kahler

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

In this paper we follow the general approach, proposed earlier by the first author, which is derived from the invariant theory field and provides a way of obtaining of the polynomial identities for any arbitrary polynomial family. We…

Combinatorics · Mathematics 2019-10-25 Leonid Bedratyuk , Nataliia Luno

In this paper we present some classes of real self-reciprocal polynomials with at most two zeros outside the unit circle which are connected with a Chebyshev quasi-orthogonal polynomials of order one. We investigated the distribution,…

Classical Analysis and ODEs · Mathematics 2017-09-12 Vanessa Botta

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…

Complex Variables · Mathematics 2025-07-11 Lennart Aljoscha Hübner , Olof Rubin
‹ Prev 1 3 4 5 6 7 10 Next ›