Extremal polynomials on the n-grid

01/04/2023
by   Arno B. J. Kuijlaars, et al.
0

The n-grid E_n consists of n equally spaced points in [-1,1] including the endpoints ± 1. The extremal polynomial p_n^* is the polynomial that maximizes the uniform norm p _[-1,1] among polynomials p of degree ≤α n that are bounded by one on E_n. For every α∈ (0,1), we determine the limit of 1/nlog p_n^*_[-1,1] as n →∞. The interest in this limit comes from a connection with an impossibility theorem on stable approximation on the n-grid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2020

Balancing Polynomials in the Chebyshev Norm

Given n polynomials p_1, …, p_n of degree at most n with p_i_∞≤ 1 for i ...
research
11/25/2019

The distribution of the L_4 norm of Littlewood polynomials

Classical conjectures due to Littlewood, Erdős and Golay concern the asy...
research
03/10/2022

Robust Radical Sylvester-Gallai Theorem for Quadratics

We prove a robust generalization of a Sylvester-Gallai type theorem for ...
research
01/11/2021

Randomized weakly admissible meshes

A weakly admissible mesh (WAM) on a continuum real-valued domain is a se...
research
06/29/2020

Error Correcting Codes, finding polynomials of bounded degree agreeing on a dense fraction of a set of points

Here we present some revised arguments to a randomized algorithm propose...
research
08/27/2019

Counting Candy Crush Configurations

A k-stable c-coloured Candy Crush grid is a weak proper c-colouring of a...
research
01/18/2021

Approximating monomials using Chebyshev polynomials

This paper considers the approximation of a monomial x^n over the interv...

Please sign up or login with your details

Forgot password? Click here to reset